Dmrs transmission

ABSTRACT

Embodiments of the present disclosure relate to methods, devices and computer readable media for DMRS transmission. A method implemented at a terminal device comprises selecting, from a plurality of computer generated (CG) sequences, a CG sequence for an uplink channel modulated with a predetermined modulation technique. The method further comprises generating, based on the selected CG sequence, a DMRS sequence for the uplink channel. In addition, the method further comprises transmitting, over the uplink channel, the DMRS sequence to a network device. The embodiments of the present disclosure can provide a set of candidate CG sequences with low PAPR, good autocorrelation performance and good cross-correlation performance for generating DMRS sequences for π/2-BPSK modulated PUSCH or PUCCH.

TECHNICAL FIELD

Embodiments of the present disclosure generally relate to the field oftelecommunication, and in particular, to methods, devices and computerstorage media for Demodulation Reference Signal (DMRS) transmission.

BACKGROUND

Typically, prior to transmission of data (including control signaling),a transmitting device may modulate the data to be transmitted. In newradio access (NR), various modulation techniques are supported, such asBinary Phase Shift Keying (BPSK), π/2-BPSK, Quadrature Phase ShiftKeying (QPSK), 16 Quadrature Amplitude Modulation (16QAM), 64QAM and256QAM. In the latest 3GPP discussion (that is, Release 16), it has beenagreed that for π/2-BPSK modulated Physical Uplink Shared Channel(PUSCH), if the allocated length for a DMRS sequence is 30 or longer, aDMRS sequence for PUSCH will be generated based on a Pseudo-randomsequence, and the modulation technique for the DMRS sequence isπ/2-BPSK. For π/2-BPSK modulated Physical Uplink Control Channel(PUCCH), if the allocated length for a DMRS sequence is 30 or longer, aDMRS sequence for PUCCH will be also generated based on thePseudo-random sequence, and the modulation technique for the DMRSsequence is π/2-BPSK. For π/2-BPSK modulated PUSCH or PUCCH, if theallocated length for a DMRS sequence is lower than 30, such as, thelength is 6, 12, 18 or 24, a DMRS sequence for PUSCH or PUCCH will begenerated based on a Computer Generated (CG) sequence and the modulationtechnique for the DMRS sequence is π/2-BPSK.

However, the detailed CG sequences used for generating DMRS sequenceshave not been specified yet.

SUMMARY

In general, example embodiments of the present disclosure providemethods, devices and computer storage media for DMRS transmission.

In a first aspect, there is provided a method implemented at a terminaldevice. The method comprises: selecting, from a plurality of computergenerated (CG) sequences, a CG sequence for an uplink channel modulatedwith a predetermined modulation technique; generating, based on theselected CG sequence, a DMRS sequence for the uplink channel; andtransmitting, over the uplink channel, the DMRS sequence to a networkdevice.

In a second aspect, there is provided a method implemented at a networkdevice. The method comprises: selecting, from a plurality of computergenerated (CG) sequences, a CG sequence for an uplink channel modulatedwith a predetermined modulation technique; determining, based on theselected CG sequence, a DMRS sequence for the uplink channel; andreceiving, over the uplink channel, the DMRS sequence from a terminaldevice.

In a third aspect, there is provided a terminal device. The terminaldevice comprises a processor and a memory coupled to the processor. Thememory stores instructions that when executed by the processor, causethe terminal device to perform the method according to the first aspectof the present disclosure.

In a fourth aspect, there is provided a network device. The networkdevice comprises a processor and a memory coupled to the processor. Thememory stores instructions that when executed by the processor, causethe network device to perform the method according to the second aspectof the present disclosure.

In a fifth aspect, there is provided a computer readable medium havinginstructions stored thereon. The instructions, when executed on at leastone processor, cause the at least one processor to perform the methodaccording to the first or second aspect of the present disclosure.

Other features of the present disclosure will become easilycomprehensible through the following description.

BRIEF DESCRIPTION OF THE DRAWINGS

Through the more detailed description of some embodiments of the presentdisclosure in the accompanying drawings, the above and other objects,features and advantages of the present disclosure will become moreapparent, wherein:

FIG. 1 illustrates an example communication network in whichimplementations of the present disclosure can be implemented;

FIG. 2 illustrates a schematic diagram of a process for DMRStransmission in accordance with some embodiments of the presentdisclosure;

FIG. 3 illustrates a flowchart of an example method for determining aplurality of CG sequences of a certain sequence length in accordancewith some embodiments of the present disclosure;

FIG. 4A shows the performance of Length-6 CG sequences for π/2-BPSK inaccordance with some embodiments of the present disclosure;

FIG. 4B shows the performance of Length-12 CG sequences for π/2-BPSK inaccordance with some embodiments of the present disclosure;

FIG. 4C shows the performance of Length-12 CG sequences for π/2-BPSK inaccordance with some embodiments of the present disclosure;

FIG. 4D shows the performance of Length-18 CG sequences for π/2-BPSK inaccordance with some embodiments of the present disclosure;

FIG. 4E shows the performance of Length-18 CG sequences for π/2-BPSK inaccordance with some embodiments of the present disclosure;

FIG. 4F shows the performance of Length-24 CG sequences for π/2-BPSK inaccordance with some embodiments of the present disclosure;

FIG. 5 illustrates a flowchart of an example method for DMRStransmission according to some embodiments of the present disclosure;

FIG. 6 illustrates a flowchart of an example method for DMRStransmission according to some embodiments of the present disclosure;and

FIG. 7 is a simplified block diagram of a device that is suitable forimplementing embodiments of the present disclosure.

Throughout the drawings, the same or similar reference numeralsrepresent the same or similar element.

DETAILED DESCRIPTION

Principle of the present disclosure will now be described with referenceto some example embodiments. It is to be understood that theseembodiments are described only for the purpose of illustration and helpthose skilled in the art to understand and implement the presentdisclosure, without suggesting any limitations as to the scope of thedisclosure. The disclosure described herein can be implemented invarious manners other than the ones described below.

In the following description and claims, unless defined otherwise, alltechnical and scientific terms used herein have the same meaning ascommonly understood by one of ordinary skills in the art to which thisdisclosure belongs.

As used herein, the singular forms ‘a’, ‘an’ and ‘the’ are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. The term ‘includes’ and its variants are to be read as openterms that mean ‘includes, but is not limited to.’ The term ‘based on’is to be read as ‘at least in part based on.’ The term ‘one embodiment’and ‘an embodiment’ are to be read as ‘at least one embodiment.’ Theterm ‘another embodiment’ is to be read as ‘at least one otherembodiment.’ The terms ‘first,’ and the like may refer to different orsame objects. Other definitions, explicit and implicit, may be includedbelow.

In some examples, values, procedures, or apparatus are referred to as‘best,’ ‘lowest,’ ‘highest,’ ‘minimum,’ ‘maximum,’ or the like. It willbe appreciated that such descriptions are intended to indicate that aselection among many used functional alternatives can be made, and suchselections need not be better, smaller, higher, or otherwise preferableto other selections.

FIG. 1 shows an example communication network 100 in whichimplementations of the present disclosure can be implemented. Thecommunication network 100 includes a network device 110 and terminaldevices 120-1, 120-2 . . . and 120-N (where N is a natural number),which can be collectively referred to as “terminal devices” 120 orindividually referred to as “terminal device” 120. The network 100 canprovide one or more cells 102 to serve the terminal device 120. It is tobe understood that the number of network devices, terminal devicesand/or cells is given for the purpose of illustration without suggestingany limitations to the present disclosure. The communication network 100may include any suitable number of network devices, terminal devicesand/or cells adapted for implementing implementations of the presentdisclosure.

As used herein, the term ‘terminal device’ refers to any device havingwireless or wired communication capabilities. Examples of the terminaldevice include, but not limited to, user equipment (UE), personalcomputers, desktops, mobile phones, cellular phones, smart phones,personal digital assistants (PDAs), portable computers, image capturedevices such as digital cameras, gaming devices, music storage andplayback appliances, or Internet appliances enabling wireless or wiredInternet access and browsing and the like.

As used herein, the term ‘network device’ or ‘base station’ (BS) refersto a device which is capable of providing or hosting a cell or coveragewhere terminal devices can communicate. Examples of a network deviceinclude, but not limited to, a Node B (NodeB or NB), an Evolved NodeB(eNodeB or eNB), a next generation NodeB (gNB), a Transmission ReceptionPoint (TRP), a Remote Radio Unit (RRU), a radio head (RH), a remoteradio head (RRH), a low power node such as a femto node, a pico node,and the like.

In the communication network 100 as shown in FIG. 1, the network device110 can communicate data and control information to the terminal device120 and the terminal device 120 can also communication data and controlinformation to the network device 110. A link from the network device110 to the terminal device 120 is referred to as a downlink (DL), whilea link from the terminal device 120 to the network device 110 isreferred to as an uplink (UL).

The communications in the network 100 may conform to any suitablestandards including, but not limited to, Global System for MobileCommunications (GSM), Long Term Evolution (LTE), LTE-Evolution,LTE-Advanced (LTE-A), Wideband Code Division Multiple Access (WCDMA),Code Division Multiple Access (CDMA), GSM EDGE Radio Access Network(GERAN), Machine Type Communication (MTC) and the like. Furthermore, thecommunications may be performed according to any generationcommunication protocols either currently known or to be developed in thefuture. Examples of the communication protocols include, but not limitedto, the first generation (1G), the second generation (2G), 2.5G, 2.75G,the third generation (3G), the fourth generation (4G), 4.5G, the fifthgeneration (5G) communication protocols.

In addition to normal data communications, the network device 110 maysend a RS in a broadcast, multi-cast, and/or unicast manners to one ormore of the terminal devices 120 in a downlink. Similarly, one or moreof the terminal devices 120 may transmit RSs to the network device 110in an uplink. As used herein, a “downlink (DL)” refers to a link from anetwork device to a terminal device, while an “uplink (UL)” refers to alink from the terminal device to the network device. Examples of the RSmay include but are not limited to Demodulation Reference Signal (DMRS),Channel State Information-Reference Signal (CSI-RS), Sounding ReferenceSignal (SRS), Phase Tracking Reference Signal (PTRS), fine time andfrequency Tracking Reference Signal (TRS) and so on.

For example, in the case of DL DMRS transmission, a DMRS may be used bythe terminal devices 120 for DL channel demodulation. Generallyspeaking, the DMRS is a signal sequence (also referred to as “DMRSsequence”) that is known by both the network device 110 and the terminaldevice 120. For example, in DL DMRS transmission, a DMRS sequence may begenerated and transmitted by the network device 110 based on a certainrule and the terminal device 120 may deduce the DMRS sequence based onthe same rule. Similarly, in the case of UL DMRS transmission, the DMRSmay be used by the network device 110 for UL channel demodulation. Forexample, in UL DMRS transmission, a DMRS sequence may be generated andtransmitted by the terminal device 120 based on a certain rule and thenetwork device 110 may deduce the DMRS sequence based on the same rule.

Typically, prior to transmission of a DMRS sequence, a transmittingdevice (such as, the terminal device 120 in UL DMRS transmission or thenetwork device 110 in DL DMRS transmission) may modulate the DMRSsequence to be transmitted. In 3GPP specifications, it has beenspecified that, in case of π/2-BPSK modulation, value b(i) is mapped tocomplex-valued modulation symbol d(i) according to:

$\begin{matrix}{{d(i)} = {\frac{e^{j\frac{\pi}{2}{({i\;{mod}\; 2})}}}{\sqrt{2}}\lbrack {( {1 - {2{b(i)}}} ) + {j( {1 - {2{b(i)}}} )}} \rbrack}} & ( {1\text{-}1} )\end{matrix}$

In 3GPP discussion (that is, Release 16), it has also been agreed thatfor π/2-BPSK modulated Physical Uplink Shared Channel (PUSCH), if theallocated length for a DMRS sequence is 30 or longer, a DMRS sequencefor PUSCH may be generated based on a Pseudo-random sequence, and themodulation technique for the DMRS sequence is π/2-BPSK. For π/2-BPSKmodulated Physical Uplink Control Channel (PUCCH), if the allocatedlength for a DMRS sequence is 30 or longer, if the length of a DMRSsequence is configured to 30 or longer, a DMRS sequence for PUCCH mayalso be generated based on the Pseudo-random sequence, and themodulation technique for the DMRS sequence is π/2-BPSK. For π/2-BPSKmodulated PUSCH or PUCCH, if the allocated length for a DMRS sequence islower than 30, such as, 6, 12, 18 or 24, a DMRS sequence for PUSCH orPUCCH may be generated based on a Computer Generated (CG) sequence, andthe modulation technique for the DMRS sequence is π/2-BPSK. However, thedetailed CG sequences used for generating DMRS sequences have not beenspecified yet.

Example embodiments of the present disclosure provide a solution forDMRS transmission. This solution can provide a set of candidate CGsequences for generating DMRS sequences for π/2-BPSK modulated PUSCH orPUCCH. The set of candidate CG sequences in accordance with embodimentsof the present disclosure can achieve low PAPR, good autocorrelationperformance and good cross-correlation performance.

FIG. 2 illustrates a process 200 for DMRS transmission in accordancewith some embodiments of the present disclosure. For the purpose ofdiscussion, the process 200 will be described with reference to FIG. 1.The process 200 may involve the network device 110 and the terminaldevice 120 served by the network device 110.

In some embodiments, a plurality of CG sequence tables may be configuredto both the network device 110 and the terminal device 120 forgenerating DMRS sequences for π/2-BPSK modulated PUSCH and/or PUCCH. Oneof the plurality of CG sequence tables may include a plurality of CGsequences, each of the plurality of CG sequences having a correspondingsequence length (such as, 6, 12, 18 or 24).

As shown in FIG. 2, in response to π/2-BPSK modulation and a sequencelength being configured to the terminal device 120, the terminal device120 may select 210, from a corresponding CG sequence table including aplurality of CG sequences (each of which has the configured sequencelength), a CG sequence for an uplink channel (PUSCH or PUCCH) modulatedwith π/2-BPSK. In some embodiments, information on the selection of theCG sequence may be configured to both the network device 110 and theterminal device 120 in advance. For example, the information mayindicate which CG sequence in the corresponding CG sequence table willbe used in a specific slot. As such, for a specific slot, the terminaldevice 120 can determine which CG sequence is to be used. The terminaldevice 120 may generate 220, based on the selected CG sequence, a DMRSsequence for the uplink channel, and transmit 230 the generated DMRSsequence over the uplink channel to the network device 110 in thespecific slot.

The network device 110 may deduce the DMRS sequence based on the samerule. As shown in FIG. 2, in response to π/2-BPSK modulation and thesequence length being configured, the network device 110 may select 240,from a corresponding CG sequence table including a plurality of CGsequences (each of which has the configured sequence length), a CGsequence for the uplink channel (PUSCH or PUCCH) modulated with π/2-BPSKin the same way as the terminal device 120. In some embodiments,information on the selection of the CG sequence may be configured toboth the network device 110 and the terminal device 120 in advance. Forexample, the information may indicate which CG sequence in thecorresponding CG sequence table will be used in a specific slot. Assuch, the network device 110 may determine, based on the configurationinformation, which CG sequence is to be used by the terminal device 120in a specific slot. The network device 110 may determine 250, based onthe selected CG sequence, a DMRS sequence to be transmitted from theterminal device 120. Then, the network device 110 may receive 230, fromthe terminal device 120, the DMRS sequence transmitted over the uplinkchannel in the specific slot.

In some embodiments, a CG sequence table including a plurality of CGsequences for generating DMRS sequences for π/2-BPSK modulated PUSCHand/or PUCCH can be determined based on at least one of the following: apredetermined length of a CG sequence, a PAPR of a CG sequence,autocorrelation of a CG sequence and cross-correlation of two CGsequences.

FIG. 3 shows a flowchart of an example method 300 for determining a CGsequence table including a plurality of CG sequences of a certainsequence length (such as, less than 30) in accordance with someembodiments of the present disclosure. In some embodiments, the method300 can be performed at the terminal device 120 and/or the networkdevice 110 as shown in FIG. 1. Alternatively, in other embodiments, themethod 300 can be performed at another device not shown in FIG. 1, andthe determined CG sequence table can be configured to both the networkdevice 110 and the terminal device in advance. It is to be understoodthat the method 300 may include additional blocks not shown and/or mayomit some blocks as shown, and the scope of the present disclosure isnot limited in this regard.

At block 310, a first set of CG sequences may be determined based on apredetermine sequence length.

In some embodiments, the predetermined sequence length may be less than30. For example, the predetermined sequence length may be any of 6, 12,18 or 24. If the predetermined sequence length is N (where 0<N<30), abinary CG sequence having a length of N can be represented as ‘b(0),b(1), . . . b(N−1)’, where b(m)=0 or 1, and m∈[0, N−1]. In someembodiments, if the predetermined sequence length is N (where 0<N<30),the first set of CG sequences may include 2^(N) sequences. For example,if N equals to 6, the first set of CG sequences may include ‘000000’,‘000001’, . . . ‘111111’. If N equals to 12, the first set of CGsequences may include ‘000000000000’, ‘000000000001’, . . .‘111111111111’. If N equals to 18, the first set of CG sequences mayinclude ‘000000000000000000’, ‘000000000000000001’, . . .‘111111111111111111’. If N equals to 24, the first set of CG sequencesmay include ‘000000000000000000000000’, ‘000000000000000000000001’, . .. ‘111111111111111111111111’.

At block 320, a second set of CG sequences are selected from the firstset of CG sequences, such that the PAPR of each of the second set of CGsequences is below a first threshold and the autocorrelation of each ofthe second set of CG sequences is below a second threshold.

It is assumed that a binary CG sequence having a length of N isrepresented as ‘b(0), b(1), . . . b(N−1)’. According to the aboveequation (1-1), in case of π/2-BPSK modulation, the above binary CGsequence will be mapped to a sequence

$\begin{matrix}{{{{Si} = \{ {{d(0)},{d(1)},{\ldots\mspace{14mu}{d( {N - 1} )}}} \}},{where}}{{d(m)} = {{\frac{e^{j\frac{\pi}{2}{({m\;{mod}\; 2})}}}{\sqrt{2}}\lbrack {( {1 - {2{b(m)}}} ) + {j( {1 - {2{b(m)}}} )}} \rbrack}\mspace{14mu}{and}}}\text{}{m\;{{\epsilon\lbrack {0,{N - 1}} \rbrack}.}}} & \;\end{matrix}$

In some embodiments, the sequence Si may be transformed into a sequenceFi by the following processes: transform precoding, mapping to resourcesin frequency domain and OFDM baseband signal generation. The PAPR of thesequence Si can be derived from dividing the maximum power in thesequence Fi by the mean power in the sequence Fi.

In some embodiments, the autocorrelation of the sequence Si can becalculated as following:

Si*Qi ^(H)=Σ_(i=0) ^(N-1) d(i)*d((i+α)mod N)*  (2)

In the above equation (2), if N equals to 12, then α∈[−2, −1, 1, 2]; ifN equals to 18, then α∈[−3, −2, −1, 1, 2, 3]; if N equals to 24, thenα∈[−5, −4, −3, −2, −1, 1, 2, 3, 4, 5]; and if N equals to 6, then α∈[−2,−1, 1, 2] or α∈[4,1]. d((i+α) mod N)* may represent the conjugate of thevalue d((i+α) mod N). H may represent the conjugate transpose of asequence. Qi may represent the sequence obtained by cyclically shiftingthe sequence Si by α. Qi^(H) may represent the conjugate transpose ofthe sequence obtained by cyclically shifting the sequence Si by α.

In some embodiments, if the predetermined sequence length is 6, thefirst threshold may be equal to or less than 1.54. Alternatively, if thepredetermined sequence length is 6, the first threshold may be equal toor less than 2.2. In some embodiments, if the predetermined sequencelength is 6, the second threshold may be equal to or less than 0.67.Alternatively, if the predetermined sequence length is 6, the secondthreshold may be equal to or less than 0.24.

In some embodiments, if the predetermined sequence length is 12, thefirst threshold may be equal to or less than 1.5. Alternatively, if thepredetermined sequence length is 12, the first threshold may be equal toor less than 1.47. In some embodiments, if the predetermined sequencelength is 12, the second threshold may be equal to or less than 0.34.

In some embodiments, if the predetermined sequence length is 18, thefirst threshold may be equal to or less than 1.4. Alternatively, if thepredetermined sequence length is 18, the first threshold may be equal toor less than 1.35. In some embodiments, if the predetermined sequencelength is 18, the second threshold may be equal to or less than 0.23.

In some embodiments, if the predetermined sequence length is 24, thefirst threshold may be equal to or less than 1. Alternatively, if thepredetermined sequence length is 24, the first threshold may be equal toor less than 1.32. In some embodiments, if the predetermined sequencelength is 24, the second threshold may be equal to or less than 0.17.Alternatively, if the predetermined sequence length is 24, the secondthreshold may be equal to or less than 0.34.

At block 330, the second set of CG sequences are divided into a firstsubset and a second subset. In some embodiments, the first subset mayinclude a predetermined number (for example, 30 or 60) of CG sequencesselected from the second set of CG sequences randomly. The second subsetmay include the rest of CG sequences in the second set of CG sequences.

At block 340, a first pair of CG sequences associated with the highestcross-correlation among the first subset are determined. In someembodiments, in case of π/2-BPSK modulation, two binary CG sequences maybe mapped to two sequences the cross-correlation of two sequencesaccording to the above equation (1-1), represented as, Si and Sj. Thecross-correlation of the two sequences Si and Sj may be calculated as:Si*Sj^(H). As such, the first pair of CG sequence associated with thehighest cross-correlation among the first subset can be determined.

At block 350, whether a second pair of CG sequences associated withlower cross-correlation than the first pair of CG sequences are presentin the second subset is determined.

In response to determining that the second pair of CG sequences arepresent in the second subset, at block 360, the first pair of CGsequences in the first subset are replaced with the second pair of CGsequences. Then, the method 300 returns to block 340.

In response to determining that the second pair of CG sequences areabsent in the second subset, at block 370, the CG sequences included inthe first subset are determined as the plurality of CG sequences in theCG sequence table.

In this way, the determined plurality of CG sequences may be associatedwith low PAPR, good autocorrelation performance and goodcross-correlation performance. For example, only for the purpose ofillustration, different CG sequence tables associated with differentsequence lengths are shown as below.

In some embodiments, for PUSCH or PUCCH, if the allocated length for aDMRS sequence is lower than 30 (such as, the length is 6, 12, 18 or 24),a predetermined sequence table T may be used for the DMRS sequencegeneration. For example, the PUSCH or PUCCH may be modulated withπ/2-BPSK. As another example, the PUSCH or PUCCH may be modulated withQPSK. As another example, the PUSCH or PUCCH may be modulated with16-QAM. As another example, the PUSCH or PUCCH may be modulated with64-QAM. As another example, the PUSCH or PUCCH may be modulated with256-QAM.

In some embodiments, for PUCCH, if the allocated length for a DMRSsequence is lower than 36, such as, the length is 12 or 24, apredetermined sequence table T may be used for the DMRS sequencegeneration. For example, the PUCCH may be modulated with π/2-BPSK. Asanother example, the PUCCH may be modulated with QPSK. As anotherexample, the PUCCH may be modulated with 16-QAM.

In some embodiments, a sequence B from the predetermined sequence tableT may be composed of a number of values b(i) and each b(i) is a binarynumber, where i is an integer and 0≤i≤N−1, and where N is the sequencelength. That is, in the sequence B, each b(i) may be 0 or 1. Thesequence B may be modulated with π/2-BPSK to be a sequence D. That is,the values b(i) may be mapped to complex-valued modulation symbols d(i)according to the above equation (1-1). In addition, the modulatedsequence D may be transformed with transform precoding to a sequence Y.That is, the modulation symbols d(i) may be transformed to be a sequencey(k) according to:

$\begin{matrix}{{y(k)} = {\frac{1}{\sqrt{N}}*{\sum_{i = 0}^{N - 1}{{d(i)}*e^{{- j}*2\pi i{k/N}}}}}} & ( {1\text{-}2} )\end{matrix}$

where k is an integer and 0≤k≤N−1. Further, the sequence y(k) may bepre-coded with a precoding matrix, mapped to physical resources and thengenerated based on OFDM baseband signal generation according to thecurrent 3GPP specification 38.211.

In some embodiments, in the predetermined sequence table T, a sequence Bshould not be included, for example, the sequence B being composed ofvalues b(i). In the sequence B, b(i)=0 and i is an integer, where0≤i≤N−1 and N is the sequence length. In some embodiments, in thepredetermined sequence table T, a sequence B should not be included, forexample, the sequence B being composed of values b(i). In the sequenceB, b(i)=1 and i is an integer, where 0≤i≤N−1 and N is the sequencelength. In some embodiments, in the predetermined sequence table T, asequence B should not be included, for example, the sequence B beingcomposed of values b(i). In the sequence B,

$\begin{matrix}{{b(i)} = \{ {{{\begin{matrix}{{0,}\ } & {{when}\mspace{14mu} i\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{integer}} \\{{1,}\ } & {{when}\mspace{14mu} i\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{even}\mspace{14mu}{integer}}\end{matrix}\mspace{14mu}{and}\mspace{14mu} 0} \leq i \leq {N - 1}},} } & \;\end{matrix}$

where N is the sequence length. In some embodiments, in thepredetermined sequence table T, a sequence B should not be included, forexample, the sequence B being composed of values b(i). In the sequenceB,

${b(i)} = \{ {{{\begin{matrix}{1,} & {{when}\mspace{14mu} i\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{integer}} \\{0,} & {{when}\mspace{14mu} i\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{even}\mspace{14mu}{integer}}\end{matrix}{and}\mspace{14mu} 0} \leq i \leq {N - 1}},} $

where N is the sequence length. In some embodiments, N can be any of {6,12, 18, 24, 30}.

In some embodiments, in the predetermined sequence table T, a sequence Bshould not be included, for example, the sequence B being composed ofvalues b(i), where i is an integer and 0≤i≤N−1 and where N is thesequence length. In the sequence B, for all values of i, the values ofb(i) may be the same. That is, for all values of i, there is only onevalue for b(i). In some embodiments, in the predetermined sequence tableT, a sequence B should not be included, for example, the sequence Bbeing composed of values b(i), where i is an integer and 0≤i≤N−1 andwhere N is the sequence length. In the sequence B, when i=2*m+1, and0≤m≤N/2−1, all the values of b(i) are the same. That is, for all valuesof i=2*m+1, and 0≤m≤N/2−1, there is only one value for b(i). In thesequence B, when i=2*m, and 0≤m≤N/2−1, all the values of b(i) are thesame. That is, for all values of i=2*m, and 0≤m≤N/2−1, there is only onevalue for b(i). In some embodiments, in the predetermined sequence tableT, a sequence B should not be included, for example, the sequence Bbeing composed of values b(i), where i is an integer and 0≤i≤N−1, andwhere N is the sequence length. In the sequence B, when i=3*m, and0≤m≤N/3−1, all the values of b(i) are the same. That is, for all valuesof i=3*m, and 0≤m≤N/3−1, there is only one value for b(i). In thesequence B, when i=3*m+1, and 0≤m≤N/3−1, all the values of b(i) are thesame. That is, for all values of i=3*m+1, and 0≤m≤N/3−1, there is onlyone value for b(i). In the sequence B, when i=3*m+2, and 0≤m≤N/3−1, allthe values of b(i) are the same. That is, for all values of i=3*m+2, and0≤m≤N/3−1, there is only one value for b(i). In some embodiments, in thepredetermined sequence table T, a sequence B should not be included, forexample, the sequence B being composed of values b(i), where i is aninteger and 0≤i≤N−1, and where N is the sequence length. In the sequenceB, when i=4*m, and 0≤m≤N/4−1, all the values of b(i) are the same. Thatis, for all values of i=4*m, and 0≤m≤N/4−1, there is only one value forb(i). In the sequence B, when i=4*m+1, and 0≤m≤N/4−1, all the values ofb(i) are the same. That is, for all values of i=4*m+1, and 0≤m≤N/4−1,there is only one value for b(i). In the sequence B, when i=4*m+2, and0≤m≤N/4−1, all the values of b(i) are the same. That is, for all valuesof i=4*m+2, and 0≤m≤N/4−1, there is only one value for b(i). In thesequence B, when i=4*m+3, and 0≤m≤N/4−1, all the values of b(i) are thesame. That is, for all values of i=4*m+3, and 0≤m≤N/4−1, there is onlyone value for b(i). In some embodiments, N can be any of {6, 12, 18, 24,30}.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i)), another sequence B_(q) cannot be included in thepredetermined sequence table T, where the sequence B_(q) is a sequenceobtained by cyclically shifting the sequence B_(p) by a. For example,the sequence B_(q) is composed of value b_(q)(i). In the sequence B_(q),=b_(p)((i+α) mod N), where i is an integer and 0≤i≤N−1, and where N isthe sequence length. For example, N can be any of {12, 18, 24, 30}. Insome embodiments, a may be any of {−5, −4, −3, −2, −1, 1, 2, 3, 4, 5}.In some embodiments, for different values of N, the possible values of αmay be different. For example, if N equals to 12, then α may be any of{−2, −1, 1, 2}. As another example, if N equals to 18, then α may be anyof {−3, −2, −1, 1, 2, 3}. As another example, if N equals to 18, then αmay be any of {−3, −1, 1, 3}. As another example, if N equals to 24,then α may be any of {−5, −4, −3, −2, −1, 1, 2, 3, 4, 5}.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), another sequenceB_(q) cannot be included in the predetermined sequence table T, wherethe sequence B_(q) has some relationship with sequence B_(p). Forexample, the sequence B_(q) is composed of values b_(q)(i). In thesequence B_(q), b_(q)(i)=(b_(p) (i)+1)mod 2, where i is an integer and0≤i≤N−1, and where N is the sequence length. For example, N can be anyof {6, 12, 18, 24, 30}.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), another sequenceB_(q) cannot be included in the predetermined sequence table T, wherethe sequence B_(q) has some relationship with sequence B_(p). Forexample, the sequence B_(q) is composed of values b_(q)(i). In thesequence B_(q),

$\begin{matrix}{{b_{q}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {{when}\mspace{14mu} i\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{integer}} \\{{{b_{p}(i)},}\ } & {{when}\mspace{14mu} i\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{even}\mspace{14mu}{integer}}\end{matrix},} } & \;\end{matrix}$

where 0≤i≤N−1 and N is the sequence length. Alternatively, in someembodiments, in the sequence B_(q),

$\begin{matrix}{{b_{q}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){{mod}2}},}\ } & {{{when}\mspace{14mu} i} = {{2*m} + 1}} \\{{{b_{p}(i)}\ ,}\ } & {{{when}\mspace{14mu} i} = {2*m}}\end{matrix},} } & \;\end{matrix}$

where 0≤m≤N/2−1 and 0≤i≤N−1, and where N is the sequence length. Forexample, N cannot be 6. As another example, N can be any of {12, 18, 24,30}.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), another sequenceB_(q) cannot be included in the predetermined sequence table T, wherethe sequence B_(q) has some relationship with sequence B_(p). Forexample, the sequence B_(q) is composed of values b_(q)(i). In thesequence B_(q),

$\begin{matrix}{{b_{q}(i)} = \{ {{{\begin{matrix}{{{( {{b_{p}(i)} + 1} ){{mod}2}},}\ } & {{when}\mspace{14mu} i\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{even}\mspace{14mu}{integer}} \\{{{b_{p}(i)}\ ,}\ } & {{when}\mspace{14mu} i\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{integer}}\end{matrix}\mspace{14mu}{and}\ 0} \leq i \leq {N - 1}},} } & \;\end{matrix}$

and where N is the sequence length. Alternatively, in the sequenceB_(q),

$\begin{matrix}{{b_{q}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {{{when}\mspace{14mu} i} = {2*m}} \\{{{b_{p}(i)}\ ,}\ } & {{{when}\mspace{14mu} i} = {{2*m} + 1}}\end{matrix},} } & \;\end{matrix}$

where 0≤m≤N/2−1 and 0≤i≤N−1, and where N is the sequence length. Forexample, N cannot be 6. As another example, N can be any of {12, 18, 24,30}.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), another sequenceB_(q) cannot be included in the predetermined sequence table T, wherethe sequence B_(q) has some relationship with sequence B_(p). Forexample, the sequence B_(q) is composed of values b_(q)(i). In thesequence B_(q),

$\begin{matrix}{{b_{q}(i)} = \{ {\begin{matrix}{{( {{b_{p}(i)} + 1} ){{mod}2}},} & {{{when}\mspace{14mu}{N/2}} \leq i \leq {N - 1}} \\{{b_{p}(i)}\ ,} & {{{when}\mspace{20mu} 0} \leq i \leq {{N/2} - 1}}\end{matrix},} } & \;\end{matrix}$

where N is the sequence length. For example, N cannot be 6. As anotherexample, N can be any of {12, 18, 24, 30}.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), another sequenceB_(q) cannot be included in the predetermined sequence table T, wherethe sequence B_(q) has some relationship with sequence B_(p). Forexample, the sequence B_(q) is composed of values b_(q)(i). In thesequence B_(q),

$\begin{matrix}{{b_{q}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {{{when}\mspace{14mu} 0} \leq i \leq {{N/2} - 1}} \\{{{b_{p}(i)}\ ,}\ } & {{{when}\mspace{14mu}{N/2}} \leq i \leq {N - 1}}\end{matrix},} } & \;\end{matrix}$

where N is the sequence length. For example, N cannot be 6. As anotherexample, N can be any of {12, 18, 24, 30}.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), other sequencesB_(q1) and B_(q2) and B_(q3) cannot be included in the predeterminedsequence table T, where the sequences B_(q1), B_(q2) and B_(q3) each hassome relationship with sequence B_(p). For example, the sequence B_(q1)is composed of values b_(q1)(i). In the sequence B_(q1),

${b_{q1}(i)} = \{ \begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {\begin{matrix}{{{when}\mspace{14mu}{N/4}} \leq i \leq {{N/2} - {1\mspace{14mu}{and}}}} \\{{3*{N/4}} \leq i \leq {N - 1}}\end{matrix}\mspace{14mu}} \\{{b_{p}(i)},} & {\begin{matrix}{{{when}\mspace{14mu} 0} \leq i \leq {{N/4} - {1\mspace{14mu}{and}}}} \\{{N/2} \leq i \leq {{3*{N/4}} - 1}}\end{matrix}\ }\end{matrix} $

where N is the sequence length. Additionally, in the sequence B_(q2),

$\begin{matrix}{{b_{q2}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {{{when}\mspace{14mu}{N/2}} \leq i \leq {N - 1}} \\{{{b_{p}(i)}\ ,}\ } & {{{when}\mspace{14mu} 0} \leq i \leq {{N/2} - 1}}\end{matrix},} } & \;\end{matrix}$

where N is the sequence length. Additionally, in the sequence B_(q3),

$\begin{matrix}{{b_{q3}(i)} = \{ {\begin{matrix}{{( {{b_{p}(i)} + 1} ){mod}\; 2},} & {{{when}\mspace{14mu}{N/4}} \leq i \leq {{3*{N/4}} - 1}} \\{{b_{p}(i)}\ ,} & \begin{matrix}{{{when}\mspace{14mu} 0} \leq i \leq {{N/4} - {1\mspace{14mu}{and}}}} \\{{3*{N/4}} \leq i \leq {N - 1}}\end{matrix}\end{matrix},} } & \;\end{matrix}$

where N is the sequence length. For example, N can only be 12. Asanother example, N can be any one of {12, 24}. As another example, Ncannot be any one of {6, 18, 30}. As another example, this predeterminedsequence table T can only be used for DMRS of PUCCH format 4.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), other sequencesB_(q1) and B_(q2) and B_(q3) cannot be included in the predeterminedsequence table T, where the sequences B_(q1), B_(q2) and B_(q3) each hassome relationship with sequence B_(p). For example, the sequence B_(q1)is composed of values b_(q1)(i). In the sequence B_(q1),

$\begin{matrix}{{b_{q1}(i)} = \{ {\begin{matrix}{{{b_{p}(i)}\ ,}} & \begin{matrix}{{{when}\mspace{14mu}{N/4}} \leq i \leq {{N/2} - {1\mspace{14mu}{and}}}} \\{\;{{3*{N/4}} \leq i \leq {N - 1}}}\end{matrix} \\{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & \begin{matrix}{{{{when}\mspace{14mu} 0} \leq i \leq {{N/4} - {1\mspace{14mu}{and}}}}{\mspace{14mu}\mspace{14mu}}} \\{{N/2} \leq i \leq {{3*{N/4}} - 1}}\end{matrix}\end{matrix},} } & \;\end{matrix}$

where N is the sequence length. Additionally, in the sequence B_(q2),

$\begin{matrix}{{b_{q2}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {{{when}\mspace{14mu} 0} \leq i \leq {{N/2} - 1}} \\{{b_{p}(i)}\ ,} & {{{when}\mspace{14mu}{N/2}} \leq i \leq {N - 1}}\end{matrix},} } & \;\end{matrix}$

where N is the sequence length. Additionally, in the sequence B_(q3),

${b_{q3}(i)} = \{ {\begin{matrix}{{( {{b_{p}(i)} + 1} ){mod}\; 2},} & {{{when}\mspace{14mu} 0} \leq i \leq {{N/4} - {1\mspace{14mu}{and}\mspace{14mu} 3*{N/4}}} \leq i \leq {N - 1}} \\{{b_{p}(i)}\ ,} & {{{when}\mspace{14mu}{N/4}} \leq i \leq {{3*{N/4}} - 1}}\end{matrix},} $

where N is the sequence length. For example, N can only be 12. Asanother example, N can be any one of {12, 24}. As another example, Ncannot be any one of {6, 18, 30}. As another example, this predeterminedsequence table T can only be used for DMRS of PUCCH format 4.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), other sequencesB_(q1) and B_(q2) and B_(q3) cannot be included in the predeterminedsequence table T, where the sequences B_(q1), B_(q2) and B_(q3) each hassome relationship with sequence B_(p). For example, the sequence B_(q1)is composed of values b_(q1)(i). In the sequence B_(q1),

$\begin{matrix}{{b_{q1}(i)} = \{ {\begin{matrix}{{( {{b_{p}(i)} + 1} ){mod}\; 2},} & {{{when}\mspace{14mu} i} = {{{4*m} + {1\mspace{14mu}{and}\mspace{14mu} i}} = {{4*m} + 3}}} \\{{b_{p}(i)}\ ,} & {{{when}\mspace{14mu} i} = {{4*m\mspace{14mu}{and}\mspace{14mu} i} = {{4*m} + 2}}}\end{matrix},} } & \;\end{matrix}$

where 0≤m≤N/4−1 and 0≤i≤N−1, and where N is the sequence length.Additionally, in the sequence B_(q2),

$\begin{matrix}{{b_{q2}(i)} = \{ {\begin{matrix}{{( {{b_{p}(i)} + 1} ){mod}\; 2},} & {{{when}\mspace{14mu} i} = {{{4*m} + {2\mspace{14mu}{and}\mspace{14mu} i}} = {{4*m} + 3}}} \\{{b_{p}(i)}\ ,} & {{{when}\mspace{14mu} i} = {{4*m\mspace{14mu}{and}\mspace{14mu} i} = {{4*m} + 1}}}\end{matrix},} } & \;\end{matrix}$

where 0≤m≤N/4−1 and 0≤i≤N−1, and where N is the sequence length.Additionally, in the sequence B_(q3),

$\begin{matrix}{{b_{q2}(i)} = \{ {\begin{matrix}{{( {{b_{p}(i)} + 1} ){mod}\; 2},} & {{{when}\mspace{14mu} i} = {{{4*m} + {1\mspace{14mu}{and}\mspace{14mu} i}} = {{4*m} + 2}}} \\{{b_{p}(i)}\ ,} & {{{when}\mspace{14mu} i} = {{4*m\mspace{14mu}{and}\mspace{14mu} i} = {{4*m} + 3}}}\end{matrix},} } & \;\end{matrix}$

where 0≤m≤N/4−1 and 0≤i≤N−1, and where N is the sequence length. Forexample, N can only be 12. As another example, N can be any one of {12,24}. As another example, N cannot be any one of {6, 18, 30}. As anotherexample, this predetermined sequence table T can only be used for DMRSof PUCCH format 4.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where each b_(p)(i) may be 0 or 1), other sequencesB_(q1) and B_(q2) and B_(q3) cannot be included in the predeterminedsequence table T, where the sequences B_(q1), B_(q2) and B_(q3) each hassome relationship with sequence B_(p). For example, the sequence B_(q1)is composed of values b_(q1)(i). In the sequence B_(q1),

$\begin{matrix}{{b_{q1}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {{{when}\mspace{14mu} i} = {{4*m\mspace{14mu}{and}\mspace{14mu} i} = {{4*m} + 2}}} \\{{{b_{p}(i)}\ ,}\mspace{7mu}} & {{{when}\ i} = {{{4*m} + {1\ {and}\mspace{14mu} i}} = {{4*m} + 3}}}\end{matrix},} } & \;\end{matrix}$

where 0≤m≤N/4−1 and 0≤i≤N−1, and where N is the sequence length.Additionally, in the sequence B_(q2),

$\begin{matrix}{{b_{q2}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {{{when}\mspace{14mu} i} = {{4*m\mspace{14mu}{and}\mspace{14mu} i} = {{4*m} + 1}}} \\{{{b_{p}(i)}\ ,}\ } & {{{when}\mspace{14mu} i} = {{{4*m} + {2\mspace{14mu}{and}{\mspace{11mu}\ }i}} = {{4*m} + 3}}}\end{matrix},} } & \;\end{matrix}$

where 0≤m≤N/4−1 and 0≤i≤N−1, and where N is the sequence length.

Additionally, in the sequence B_(q3),

$\begin{matrix}{{b_{q2}(i)} = \{ {\begin{matrix}{{{( {{b_{p}(i)} + 1} ){mod}\; 2},}\ } & {{{when}\mspace{14mu} i} = {{4*m\mspace{14mu}{and}\mspace{14mu} i} = {{4*m} + 3}}} \\{{{b_{p}(i)}\ ,}\ } & {{{when}\mspace{14mu} i} = {{{4*m} + {1\mspace{14mu}{and}\mspace{14mu} i}} = {{4*m} + 2}}}\end{matrix},} } & \;\end{matrix}$

where 0≤m≤N/4−1 and 0≤i≤N−1, and where N is the sequence length. Forexample, N can only be 12. As another example, N can be any one of {12,24}. As another example, N cannot be any one of {6, 18, 30}. As anotherexample, this predetermined sequence table T can only be used for DMRSof PUCCH format 4.

In some embodiments, a sequence B from the predetermined sequence tableT may be composed of a number of values b(i) and each b(i) may be anyone of {−3, −1, 1, 3}, where i is an integer and 0≤i≤N−1, and where N isthe sequence length. The sequence B may be modulated (for example, withQPSK) to be a sequence D. That is, the values b(i) may be mapped tocomplex-valued modulation symbols d(i) according to:

d(i)=e ^(j*b(i)π/4)  (1-3)

In addition, the modulated sequence D may be transformed with transformprecoding to a sequence Y. That is, the modulation symbols d(i) may betransformed to be a sequence y(k) according to the above equation (1-2).Further, the sequence y(k) may be precoded with a precoding matrix,mapped to physical resources and then generated based on OFDM basebandsignal generation according to the current 3GPP specification 38.211.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where b_(p)(i) may be any one of {−3, −1, 1, 3}),another sequence B_(q) cannot be included in the predetermined sequencetable T. For example, the sequence B_(q) may be composed of valuesb_(q)(i) and

${b_{q}(i)} = \{ {\begin{matrix}{{- 3},} & {if} & {{b_{p}(i)} = 1} \\{{- 1},} & {if} & {{b_{p}(i)} = 3} \\{1,} & {if} & {{b_{p}(i)} = {- 3}} \\{3,} & {if} & {{b_{p}(i)} = {- 1}}\end{matrix},} $

where i is an integer and 0≤i≤N−1, and where N is the sequence length.For example, N can be only 6. As another example, N can be any one of{6, 12, 18, 24, 30}. As another example, this predetermined sequencetable T cannot be used for DMRS of PUCCH.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where b_(p)(i) may be any one of {−3, −1, 1, 3}),another sequence B_(q) cannot be included in the predetermined sequencetable T. For example, the sequence B_(q) may be composed of valuesb_(q)(i), where

${b_{q}(i)} = \{ {\begin{matrix}{{- 3},} & {if} & {{b_{p}(i)} = 1} \\{{- 1},} & {if} & {{b_{p}(i)} = 3} \\{1,} & {if} & {{b_{p}(i)} = {- 3}} \\{3,} & {if} & {{b_{p}(i)} = {- 1}}\end{matrix},{{{if}\mspace{14mu} i} = {{2*m} + 1}},{{{and}{b_{q}(i)}} = {b_{p}(i)}},{{{if}\mspace{14mu} i} = {2*{m.}}}} $

In addition, 0≤m≤N/2-1 and 0≤i≤N−1, where N is the sequence length. Forexample, N can be only 6. As another example, N can be any one of {6,12, 18, 24, 30}. As another example, this predetermined sequence table Tcannot be used for DMRS of PUCCH.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where b_(p)(i) may be any one of {−3, −1, 1, 3}),another sequence B_(q) cannot be included in the predetermined sequencetable T. For example, the sequence B_(q) may be composed of valuesb_(q)(i), where

${b_{q}(i)} = \{ {\begin{matrix}{{- 3},} & {if} & {{b_{p}(i)} = 1} \\{{- 1},} & {if} & {{b_{p}(i)} = 3} \\{1,} & {if} & {{b_{p}(i)} = {- 3}} \\{3,} & {if} & {{b_{p}(i)} = {- 1}}\end{matrix},{{{if}\mspace{14mu} i} = {2*m}},{{{and}{b_{q}(i)}} = {b_{p}(i)}},{{{if}\mspace{14mu} i} = {{2*m} + 1.}}} $

In addition, 0≤m≤N/2-1 and 0≤i≤N−1, where N is the sequence length. Forexample, N can be only 6. As another example, N can be any one of {6,12, 18, 24, 30}. As another example, this predetermined sequence table Tcannot be used for DMRS of PUCCH.

In some embodiments, a sequence B from the predetermined sequence tableT may be composed of a number of values b(i) and each b(i) may be anyone of {−7, −5, −3, −1, 1, 3, 5, 7}, where i is an integer and 0≤i≤N−1,and where N is the sequence length. The sequence B may be modulated (forexample, with QPSK) to be a sequence D. That is, the values b(i) may bemapped to complex-valued modulation symbols d(i) according to:

d(i)=e ^(j*b(i)π/8)  (1-4)

In addition, the modulated sequence D may be transformed with transformprecoding to a sequence Y. That is, the modulation symbols d(i) may betransformed to be a sequence y(k) according to the above equation (1-2).Further, the sequence y(k) may be precoded with a precoding matrix,mapped to physical resources and then generated based on OFDM basebandsignal generation according to the current 3GPP specification 38.211.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where b_(p)(i) may be any one of {−7, −5, −3, −1, 1,3, 5, 7}), another sequence B_(q) cannot be included in thepredetermined sequence table T. For example, the sequence B_(q) may becomposed of values

${{b_{q}(t)}\mspace{14mu}{and}\mspace{14mu}{b_{q}(i)}} = \{ {\begin{matrix}{{- 7},} & {if} & {{b_{p}(i)} = 1} \\{{- 5},} & {if} & {{b_{p}(i)} = 3} \\{{- 3},} & {if} & {{b_{p}(i)} = 5} \\{{- 1},} & {if} & {{b_{p}(i)} = 7} \\{7,} & {if} & {{b_{p}(i)} = {- 1}} \\{5,} & {if} & {{b_{p}(i)} = {- 3}} \\{3,} & {if} & {{b_{p}(i)} = {- 5}} \\{1,} & {if} & {{b_{p}(i)} = {- 7}}\end{matrix},} $

where i is an integer and 0≤i≤N−1, and where N is the sequence length.For example, N can be only 6. As another example, N can be any one of{6, 12, 18, 24, 30}. As another example, this predetermined sequencetable T cannot be used for DMRS of PUCCH.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where b_(p)(i) may be any one of {−7, −5, −3, −1, 1,3, 5, 7}), another sequence B_(q) cannot be included in thepredetermined sequence table T. For example, the sequence B_(q) may becomposed of values

${{b_{q}(t)}\mspace{14mu}{and}\mspace{14mu}{b_{q}(i)}} = \{ {\begin{matrix}{{- 7},} & {if} & {{b_{p}(i)} = 1} \\{{- 5},} & {if} & {{b_{p}(i)} = 3} \\{{- 3},} & {if} & {{b_{p}(i)} = 5} \\{{- 1},} & {if} & {{b_{p}(i)} = 7} \\{7,} & {if} & {{b_{p}(i)} = {- 1}} \\{5,} & {if} & {{b_{p}(i)} = {- 3}} \\{3,} & {if} & {{b_{p}(i)} = {- 5}} \\{1,} & {if} & {{b_{p}(i)} = {- 7}}\end{matrix},{{{if}\mspace{14mu} i} = {{2*m} + 1}},{{{and}\mspace{14mu}{b_{q}(i)}} = {b_{p}(i)}},{{{if}\mspace{14mu} i} = {2*{m.}}}} $

In addition, 0≤m≤N/2−1 and 0≤i≤N−1, where N is the sequence length. Forexample, N can be only 6. As another example, N can be any one of {6,12, 18, 24, 30}. As another example, this predetermined sequence table Tcannot be used for DMRS of PUCCH.

In some embodiments, in the predetermined sequence table T, if onesequence B_(p) is included (for example, the sequence B_(p) is composedof values b_(p)(i), where b_(p)(i) may be any one of {−7, −5, −3, −1, 1,3, 5, 7}), another sequence B_(q) cannot be included in thepredetermined sequence table T. For example, the sequence B_(q) may becomposed of values

${{b_{q}(t)}\mspace{14mu}{and}\mspace{14mu}{b_{q}(i)}} = \{ {\begin{matrix}{{- 7},} & {if} & {{b_{p}(i)} = 1} \\{{- 5},} & {if} & {{b_{p}(i)} = 3} \\{{- 3},} & {if} & {{b_{p}(i)} = 5} \\{{- 1},} & {if} & {{b_{p}(i)} = 7} \\{7,} & {if} & {{b_{p}(i)} = {- 1}} \\{5,} & {if} & {{b_{p}(i)} = {- 3}} \\{3,} & {if} & {{b_{p}(i)} = {- 5}} \\{1,} & {if} & {{b_{p}(i)} = {- 7}}\end{matrix},{{{if}\mspace{14mu} i} = {2*m}},{{{and}\mspace{14mu}{b_{q}(i)}} = {b_{p}(i)}},{{{if}\mspace{14mu} i} = {{2*m} + 1.}}} $

In addition, 0≤m≤N/2−1, and 0≤i≤N−1, where N is the sequence length. Forexample, N can be only 6. As another example, N can be any one of {6,12, 18, 24, 30}. As another example, this predetermined sequence table Tcannot be used for DMRS of PUCCH.

In some embodiments, for the DMRS sequence for PUSCH, there may be up to4 DMRS ports (for example, respective port indices may be 0, 1, 2 and 3)with the number of frontloaded DMRS symbol equaling to one. Alternative,for the DMRS sequence for PUSCH, there may be up to 8 DMRS ports (forexample, respective port indices may be 0, 1, 2, 3, 4, 5, 6 and 7) withthe number of frontloaded DMRS symbol equaling to two. In someembodiments, the DMRS sequence for PUSCH before transformation (forexample, based on the above equation (1-2)) may ber^({tilde over (p)})(n)=w_({tilde over (p)})(n)*d(n), wherew_({tilde over (p)})(n)=

$\{ {\begin{matrix}{1,} & {{{{when}\mspace{14mu}\overset{\sim}{p}} = 0},2,4,6} \\{( {- 1} )^{n},} & {{{when}\mspace{14mu}\overset{\sim}{p}} = {1.3{.5}{.7}}}\end{matrix}{and}\overset{\sim}{p}\mspace{14mu}{represents}\mspace{14mu}{the}\mspace{14mu}{port}\mspace{14mu}{{index}.}} $

In some embodiments, for DMRS sequence for PUSCH modulated with pi/2BPSK, according to the Table 6.4.1.1.3-1 in 3GPP TS 38.211 (“NR;Physical channels and modulation”), for all of the values of {tilde over(p)} (such as, {tilde over (p)}∈[0, 7]), the value of w_(f) (k′)=+1,where k′∈ [0, 1].

In some embodiments, the DMRS sequence for PUSCH or PUCCH may bemodulated according to the above equation (1-1) (for example, modulatedwith π/2-BPSK). In some embodiments, the DMRS sequence for PUSCH orPUCCH may be modulated according to the above equation (1-3) (forexample, modulated with QPSK). In some embodiments, the DMRS sequencefor PUSCH or PUCCH may be modulated according to the above equation(1-4) (for example, modulated with 8PSK).

In some cases, for a given sequence length N, the predetermined sequencetable for the DMRS sequence of PUSCH may be represented as T₁, while thepredetermined sequence table for the DMRS sequence of PUCCH may berepresented as T₂. In some embodiments, in this case, there may be atleast one sequence from table T₁ which is different from all of thesequences in table T₂. For example, the sequence length N can be any oneof {12, 24}.

In some cases, for a given sequence length N, the predetermined sequencetable for the DMRS of PUCCH format 3 may be represented as T₁, while thepredetermined sequence table for the DMRS of PUCCH format 4 may berepresented as T₂. In some embodiments, in this case, there may be atleast one sequence from table T₁ which is different from all of thesequences in table T₂. For example, the sequence length N can be any oneof {12, 24}. As another example, the sequence length N can only be 12.

In some cases, for a given sequence length N₁, the predeterminedsequence table for the DMRS of PUSCH may be represented as T₁. In someembodiments, for example, N₁ can be any one of {6, 12, 18, 24, 30}. Insome cases, for a given sequence length N₂, the predetermined sequencetable for the DMRS of PUCCH format 3 may be represented as T₂. In someembodiments, for example, N₂ can be either 12 or 24. In some cases, fora given sequence length N₃, the predetermined sequence table for theDMRS of PUCCH format 4 may be represented as T₃. In some embodiments,for example, N₃ can only be 12.

In some embodiments, if the number of allocated Resource Blocks (RBs)for PUSCH is M (where M is an integer and M>0), the length of the DMRSsequence for the PUSCH is N=12*M/2. In some embodiments, if the numberof allocated RBs for PUSCH is M (where M≥5 or M>5) or if the length ofthe DMRS sequence for the PUSCH is N (where N≥30 or N>30), the DMRSsequence for the PUSCH may be generated based on a pseudo-randomsequence. In some embodiments, if the number of allocated RBs for PUSCHis M (where M≥5 or M>5) or if the length of the DMRS sequence for thePUSCH is N (where N≥30 or N>30), there may be no sequence hopping and/orgroup hopping. In some embodiments, if the number of allocated RBs forPUSCH is M (where M≥5 or M>5) or if the length of the DMRS sequence forthe PUSCH is N (where N≥30 or N>30), the higher-layer parametergroupHoppingEnabledTransformPrecoding and/or sequenceGroupHopping and/orsequenceHopping may be ignored.

In some embodiments, if the number of allocated Resource Blocks (RBs)for PUCCH is M (where M is an integer and M>0), the length of the DMRSsequence for the PUCCH is N=12*M. In some embodiments, if the number ofallocated RBs for PUCCH is M (where M≥3 or M>3) or if the length of theDMRS sequence for the PUCCH is N (where N≥36 or N>36), the DMRS sequencefor the PUCCH may be generated based on a pseudo-random sequence. Insome embodiments, if the number of allocated RBs for PUCCH is M (whereM≥3 or M>3) or if the length of the DMRS sequence for the PUCCH is N(where N≥36 or N>36), there may be no sequence hopping and/or grouphopping. In some embodiments, if the number of allocated RBs for PUCCHis M (where M≥3 or M>3) or if the length of the DMRS sequence for thePUCCH is N (where N≥36 or N>36), the higher-layer parameterpucch-GroupHopping may be ignored. In some embodiments, if the number ofallocated RBs for PUCCH is M (where M≥3 or M>3) or if the length of theDMRS sequence for the PUCCH is N (where N≥36 or N>36), the higher-layerparameter pucch-GroupHopping may be only configured as ‘neither’. Insome embodiments, if the number of allocated RBs for PUCCH is M (whereM≥3 or M>3) or if the length of the DMRS sequence for the PUCCH is N(where N≥36 or N>36), the higher-layer parameter pucch-GroupHopping mayonly be configured as ‘neither’ or ‘enabled’. In some embodiments, ifthe number of allocated RBs for PUCCH is M (where M≥3 or M>3) or if thelength of the DMRS sequence for the PUCCH is N (where N≥36 or N>36), thevalue of sequence hopping (such as, ‘ν’ in the 3GPP specification38.211) may be fixed as 0.

In some embodiments, if the number of allocated RBs for PUSCH is M(where M<5, for example, M∈{1, 2, 3, 4}; or M≤5, for example, M∈{1, 2,3, 4, 5}) or if the length of the DMRS sequence for the PUSCH is N(where N<30, for example, N∈{6, 12, 18, 24}; or N≤30, for example, N∈{6,12, 18, 24, 30}), the DMRS sequence for PUSCH may be generated based ona Computer Generated (CG) sequence, and there may be 30 sequences in thepredetermined sequence table. In some embodiments, if the number ofallocated RBs for PUSCH is M (where M<5, for example, M∈{1, 2, 3, 4}; orM≤5, for example, M∈{1, 2, 3, 4, 5}) or if the length of the DMRSsequence for the PUSCH is N (where N<30, for example, N∈{6, 12, 18, 24};or N≤30, for example, N∈{6, 12, 18, 24, 30}), there may be sequencehopping and/or group hopping within the sequence table. In someembodiments, if the number of allocated RBs for PUSCH is M (where M<5,for example, M∈{1, 2, 3, 4}; or M≤5, for example, M∈{1, 2, 3, 4, 5}) orif the length of the DMRS sequence for the PUSCH is N (where N<30, forexample, N∈{6, 12, 18, 24}; or N≤30, for example, N∈{6, 12, 18, 24,30}), there may be only group hopping. In some embodiments, if thenumber of allocated RBs for PUSCH is M (where M<5, for example, M∈{1, 2,3, 4}; or M≤5, for example, M∈{1, 2, 3, 4, 5}) or if the length of theDMRS sequence for the PUSCH is N (where N<30, for example, N∈{6, 12, 18,24}; or N≤30, for example, N∈{6, 12, 18, 24, 30}), the higher-layerparameter sequenceHopping may be ignored. In some embodiments, if thenumber of allocated RBs for PUSCH is M (where M<5, for example, M∈{1, 2,3, 4}; or M≤5, for example, M∈{1, 2, 3, 4, 5}) or if the length of theDMRS sequence for the PUSCH is N (where N<30, for example, N∈{6, 12, 18,24}; or N≤30, for example, N∈{6, 12, 18, 24, 30}), there may be onlysequence hopping. In some embodiments, if the number of allocated RBsfor PUSCH is M (where M<5, for example, M∈{1, 2, 3, 4}; or M≤5, forexample, M∈{1, 2, 3, 4, 5}) or if the length of the DMRS sequence forthe PUSCH is N (where N<30, for example, N∈{6, 12, 18, 24}; or N≤30, forexample, N∈{6, 12, 18, 24, 30}), the higher-layer parametersequenceGroupHopping and/or groupHoppingEnabledTransformPrecoding may beignored. In some embodiments, if the number of allocated RBs for PUSCHis M (where M<5, for example, M∈{1, 2, 3, 4}; or M≤5, for example, M∈{1,2, 3, 4, 5}) or if the length of the DMRS sequence for the PUSCH is N(where N<30, for example, N∈{6, 12, 18, 24}; or N≤30, for example, N∈{6,12, 18, 24, 30}), the value of sequence hopping (such as, ‘ν’ in the3GPP specification 38.211) may be fixed as 0.

In some embodiments, if the number of allocated RBs for PUCCH is M(where M<3, for example, M∈{1, 2}; or M≤3, for example, M∈{1, 2, 3}) orif the length of the DMRS sequence for the PUSCH is N (where N<36, forexample N∈{12, 24}; or N≤36, for example, N∈{12, 24, 36}), the DMRSsequence for PUSCH may be generated based on a Computer Generated (CG)sequence, and there may be 30 sequences in the predetermined sequencetable. In some embodiments, if the number of allocated RBs for PUCCH isM (where M<3, for example, M∈{1, 2}; or M≤3, for example, M∈{1, 2, 3})or if the length of the DMRS sequence for the PUSCH is N (where N<36,for example N∈{12, 24}; or N≤36, for example, N∈{12, 24, 36}), there maybe sequence hopping and/or group hopping within the sequence table. Insome embodiments, if the number of allocated RBs for PUCCH is M (whereM<3, for example, M∈{1, 2}; or M≤3, for example, M∈{1, 2, 3}) or if thelength of the DMRS sequence for the PUSCH is N (where N<36, for exampleN∈{12, 24}; or N≤36, for example, N∈{12, 24, 36}), there may be onlygroup hopping. In some embodiments, if the number of allocated RBs forPUCCH is M (where M<3, for example, M∈{1, 2}; or M≤3, for example, M∈{1,2, 3}) or if the length of the DMRS sequence for the PUSCH is N (whereN<36, for example N∈{12, 24}; or N≤36, for example, N∈{12, 24, 36}), thehigher-layer parameter sequenceHopping may be ignored. In someembodiments, if the number of allocated RBs for PUCCH is M (where M<3,for example, M∈{1, 2}; or M≤3, for example, M∈{1, 2, 3}) or if thelength of the DMRS sequence for the PUSCH is N (where N<36, for exampleN∈{12, 24}; or N≤36, for example, N∈{12, 24, 36}), there may be onlysequence hopping. In some embodiments, if the number of allocated RBsfor PUCCH is M (where M<3, for example, M∈{1, 2}; or M≤3, for example,M∈{1, 2, 3}) or if the length of the DMRS sequence for the PUSCH is N(where N<36, for example N∈{12, 24}; or N≤36, for example, N∈{12, 24,36}), the higher-layer parameter pucch-GroupHopping may be onlyconfigured as ‘neither’. In some embodiments, if the number of allocatedRBs for PUCCH is M (where M<3, for example, M∈{1, 2}; or M≤3, forexample, M∈{1, 2, 3}) or if the length of the DMRS sequence for thePUSCH is N (where N<36, for example N∈{12, 24}; or N≤36, for example,N∈{12, 24, 36}), the higher-layer parameter pucch-GroupHopping may onlybe configured as ‘neither’ or ‘enabled’. In some embodiments, if thenumber of allocated RBs for PUCCH is M (where M<3, for example, M∈{1,2}; or M≤3, for example, M∈{1, 2, 3}) or if the length of the DMRSsequence for the PUSCH is N (where N<36, for example N∈{12, 24}; orN≤36, for example, N∈{12, 24, 36}), the value of sequence hopping (suchas, ‘ν’ in the 3GPP specification 38.211) may be fixed as 0.

In some embodiments, if the number of allocated RBs for PUSCH is M(where M≥5 or M>5), the length of the DMRS sequence for the PUSCH isN=12*M/2, and the DMRS sequence for the PUSCH may be generated based ona pseudo-random sequence. In some embodiments, if the number ofallocated RBs for PUCCH is M (where M≥3 or M>3), the length of the DMRSsequence for the PUCCH is N=12*M, and the DMRS sequence for the PUCCHmay be generated based on a pseudo-random sequence. In some embodiments,the pseudo-random sequence generator may be initialized with:

c _(init)=(2^(X)(N _(symb) ^(slot) n _(s,f) ^(μ) +l+1)(Y·n _(ID)^(RS)+1)+Z·n _(ID) ^(RS))mod P

or

c _(init)=2^(X)(N _(symb) ^(slot) n _(s,f) ^(μ) +l+1)(Y·n _(ID)^(RS)+1)+Z·n _(ID) ^(RS)

where l represents the OFDM symbol number within a slot, and n_(s,f)^(μ) represents the slot number within a frame. If n_(ID) ^(PUSCH) isconfigured by the higher-layer parameter nPUSCH-Identity in theDMRS-Uplink IE and the PUSCH is not a msg3 PUSCH, then n_(ID)^(RS)=n_(ID) ^(PUSCH), otherwise n_(ID) ^(RS)=N_(ID) ^(cell), whereN_(ID) ^(cell) is the physical layer cell identity. In addition, X maybe any one of {10, 11, 12, 16, 17}, Y may be any one of {1, 2}, and Zmay be any one of {1, 2}. P may be 2³¹ or 30 or 60, if P is present inthe formula. N_(symb) ^(slot) represents the number of consecutive OFDMsymbols in a slot, where N_(symb) ^(slot) depends on the cyclic prefix.For example, for normal cyclic prefix, N_(symb) ^(slot)=14. As anotherexample, for extended cyclic prefix, N_(symb) ^(slot)=12.

In some embodiments, if the number of allocated RBs for PUSCH is M(where M≥5 or M>5), the length of the DMRS sequence for the PUSCH isN=12*M/2, and the DMRS sequence for the PUSCH may be generated based ona pseudo-random sequence. In some embodiments, if the number ofallocated RBs for PUCCH is M (where M≥3 or M>3), the length of the DMRSsequence for the PUCCH is N=12*M, and the DMRS sequence for the PUCCHmay be generated based on a pseudo-random sequence. In some embodiments,the pseudo-random sequence generator may be initialized with:

c _(init)=(2^(X)(N _(symb) ^(slot) n _(s,f) ^(μ) +l+1)(Y·n _(ID)+1)+Z·n_(ID))mod P

or

c _(init)=2^(X)(N _(symb) ^(slot) n _(s,f) ^(μ) +l+1)(Y·n _(ID)+1)+Z·n_(ID)

where l represents the OFDM symbol number within a slot, and n_(s,f)^(μ) represents the slot number within a frame. In addition, X may beany one of {5, 6, 7, 10, 11, 12, 16, 17}, Y may be any one of {1, 2} andZ may be any one of {1, 2}. P may be 2³¹ or 30 or 60, if P is present inthe formula. N_(symb) ^(slot) represents the number of consecutive OFDMsymbols in a slot, where N_(symb) ^(slot) depends on the cyclic prefix.For example, for normal cyclic prefix, N_(symb) ^(slot)=14. As anotherexample, for extended cyclic prefix, N_(symb) ^(slot)=12. In someembodiments, for PUSCH, if n_(ID) ^(PUSCH) is configured by thehigher-layer parameter nPUSCH-Identity in the DMRS-Uplink IE and thePUSCH is not a msg3 PUSCH, then n_(ID)=n_(ID) ^(PUSCH) mod 30 orn_(ID)=└n_(ID) ^(PUSCH)/30┘ or n_(ID)=n_(ID) ^(PUSCH), otherwisen_(ID)=N_(ID) ^(cell) mod 30 or n_(ID)=└N_(ID) ^(PUSCH)/30┘ orn_(ID)=N_(ID) ^(cell), where N_(ID) ^(cell) is the physical layer cellidentity. In some embodiments, for PUCCH, if the higher-layer parameterhoppingID is configured, the value of n_(ID) is given by hoppingID orn_(ID)=hoppingID mod 30 or n_(ID)=└hoppingID/30┘, otherwise (forexample, if the higher-layer parameter hoppingID is not configured),n_(ID)=N_(ID) ^(cell) mod 30 or n_(ID)=└N_(ID) ^(cell)/30┘ orn_(ID)=N_(ID) ^(cell), where N_(ID) ^(cell) is the physical layer cellidentity.

In some embodiments, if the number of allocated RBs for PUSCH is M(where M≥5 or M>5), the length of the DMRS sequence for the PUSCH isN=12*M/2, and the DMRS sequence for the PUSCH may be generated based ona pseudo-random sequence. In some embodiments, if the number ofallocated RBs for PUCCH is M (where M≥3 or M>3), the length of the DMRSsequence for the PUCCH is N=12*M, and the DMRS sequence for the PUCCHmay be generated based on a pseudo-random sequence. In some embodiments,the pseudo-random sequence generator may be initialized with:

c _(init)=(f _(gh) +n _(ID) ^(RS))mod 30

where if group hopping is enabled, f_(gh)=(Σ_(m=0) ⁷2^(m)·c(8(N_(symb)^(slot)n_(s,f) ^(μ)+l)+m))mod 30; and if group hopping is disabled,f_(gh)=0. c(i) represents a pseudo-random sequence, which is initializedwith c_(init)=└n_(ID) ^(RS)/30┘ or c_(init)=n_(ID) ^(RS) orc_(init)=n_(ID) ^(RS), mod 30. l represents the OFDM symbol numberwithin a slot, and n_(s,f) ^(μ) represents the slot number within aframe. N_(symb) ^(slot) represents the number of consecutive OFDMsymbols in a slot, where N_(symb) ^(slot) depends on the cyclic prefix.For example, for normal cyclic prefix, N_(symb) ^(slot)=14. As anotherexample, for extended cyclic prefix, N_(symb) ^(slot)=12. In someembodiments, for PUSCH, if n_(ID) ^(PUSCH) is configured by thehigher-layer parameter nPUSCH-Identity in the DMRS-Uplink IE and thePUSCH is not a msg3 PUSCH, then n_(ID) ^(RS)=n_(ID) ^(PUSCH), otherwisen_(ID) ^(RS)=N_(ID) ^(cell), where N_(ID) ^(cell) is the physical layercell identity. In some embodiments, for PUCCH, if the higher-layerparameter hoppingID is configured, the value of n_(ID) is given byhoppingID, otherwise (for example, if the higher-layer parameterhoppingID is not configured), n_(ID)=N_(ID) ^(cell), where N_(ID)^(cell) is the physical layer cell identity.

In some embodiments, if the number of allocated RBs for PUSCH is M(where M<5, for example, M∈{1, 2, 3, 4}; or M≤5, for example, M∈{1, 2,3, 4, 5}) or if the length of the DMRS sequence for the PUSCH is N(where N<30, for example, N∈{6, 12, 18, 24}; or N≤30, for example, N∈{6,12, 18, 24, 30}), the DMRS sequence for PUSCH may be generated based ona Computer Generated (CG) sequence, and there may be 30 or 60 sequencesin the predetermined sequence table. In some embodiments, if the numberof allocated RBs for PUCCH is M (where M<3, for example, M∈{1, 2}; orM≤3, for example, M∈{1, 2, 3}) or if the length of the DMRS sequence forthe PUCCH is N (where N<36, for example, N∈{12, 24}; or N≤36, forexample, N∈{12, 24, 36}), the DMRS sequence for the PUCCH may begenerated based on a pseudo-random sequence, and there may be 30 or 60sequences in the predetermined sequence table. In some embodiments, anindex μ of a sequence within the predetermined sequence table may be:

μ=(f _(gh) +n _(ID) ^(RS))mod 30

where if group hopping is enabled, f_(gh)=(Σ_(m=0) ⁷2^(m)·c(8(N_(symb)^(slot)n_(s,f) ^(μ)+l)+m))mod 30; and if group hopping is disabled,f_(gh)=0. c(i) represents a pseudo-random sequence, which is initializedwith c_(init)=└n_(ID) ^(RS)/30┘ or c_(init)=n_(ID) ^(RS). l representsthe OFDM symbol number within a slot, and n_(s,f) ^(μ) represents theslot number within a frame. N_(symb) ^(slot) represents the number ofconsecutive OFDM symbols in a slot, where N_(symb) ^(slot) depends onthe cyclic prefix. For example, for normal cyclic prefix, N_(symb)^(slot)=14. As another example, for extended cyclic prefix, N_(symb)^(slot)=12. In some embodiments, for PUSCH, if n_(ID) ^(PUSCH) isconfigured by the higher-layer parameter nPUSCH-Identity in theDMRS-Uplink IE and the PUSCH is not a msg3 PUSCH, then n_(ID)^(RS)=n_(ID) ^(PUSCH), otherwise n_(ID) ^(RS)=N_(ID) ^(cell), whereN_(ID) ^(cell) is the physical layer cell identity. In some embodiments,for PUCCH, if the higher-layer parameter hoppingID is configured, thevalue of n_(ID) is given by hoppingID, otherwise (for example, if thehigher-layer parameter hoppingID is not configured), n_(ID)=N_(ID)^(cell), where N_(ID) ^(cell) is the physical layer cell identity.

In some embodiments, if the number of allocated RBs for PUSCH is M(where M<5, for example, M∈{1, 2, 3, 4}; or M≤5, for example, M∈{1, 2,3, 4, 5}) or if the length of the DMRS sequence for the PUSCH is N(where N<30, for example, N∈{6, 12, 18, 24}; or N≤30, for example, N∈{6,12, 18, 24, 30}), the DMRS sequence for PUSCH may be generated based ona Computer Generated (CG) sequence, and there may be 30 or 60 sequencesin the predetermined sequence table. In some embodiments, if the numberof allocated RBs for PUCCH is M (where M<3, for example, M∈{1, 2}; orM≤3, for example, M∈{1, 2, 3}), or if the length of the DMRS sequencefor PUCCH is N (where N<36, for example N∈{12, 24}; or N≤36, forexample, N∈{12, 24, 36}), the DMRS sequence for the PUCCH may begenerated based on a pseudo-random sequence, and there may be 30 or 60sequences in the predetermined sequence table. In some embodiments, anindex μ of a sequence within the predetermined sequence table may be:

μ=(f _(gh) +f _(ss))mod 30

where if group hopping is enabled, f_(gh)=(E_(m=0) ⁷2^(m)·c(8(2n_(s,f)^(μ)+n_(hop))+m))mod 30; and if group hopping is disabled, f_(gh)=0. Inaddition, f_(ss)=n_(ID) mod 30. c(i) represents a pseudo-randomsequence, which is initialized with c_(init)=└n_(ID)/30┘ orc_(init)=n_(ID). n_(s,f) ^(μ) represents the slot number within a frame.n_(hop) represents a frequency hopping index, where if intra-slotfrequency hopping is disabled by the higher-layer parameterintraSlotFrequencyHopping, n_(hop)=0; and if intra-slot frequencyhopping is enabled by the higher-layer parameterintraSlotFrequencyHopping, n_(hop)=0 for the first hop, and n_(hop)=1for the second hop. N_(symb) ^(slot) represents the number ofconsecutive OFDM symbols in a slot, where N_(symb) ^(slot) depends onthe cyclic prefix. For example, for normal cyclic prefix, N_(symb)^(slot)=14. As another example, for extended cyclic prefix, N_(symb)^(slot)=12. In some embodiments, for PUCCH, if the higher-layerparameter hoppingID is configured, the value of n_(ID) is given byhoppingID, otherwise (for example, if the higher-layer parameterhoppingID is not configured), n_(ID)=N_(ID) ^(cell), where N_(ID)^(cell) is the physical layer cell identity.

In some embodiments, if the number of allocated RBs for PUSCH is M(where M<5, for example, M∈{1, 2, 3, 4}; or M≤5, for example, M∈{1, 2,3, 4, 5}) or if the length of the DMRS sequence for the PUSCH is N(where N<30, for example, N∈{6, 12, 18, 24}; or N≤30, for example, N∈{6,12, 18, 24, 30}), the DMRS sequence for PUSCH may be generated based ona Computer Generated (CG) sequence. In some embodiments, if the numberof allocated RBs for PUCCH is M (where M<3, for example, M∈{1, 2, 3}; orM≤3, for example, M∈{1, 2}), or if the length of the DMRS sequence forthe PUCCH is N (where N<36, for example, N∈{12, 24}; or N≤36, forexample, N∈{12, 24, 36}), the DMRS sequence for the PUCCH may begenerated based on a pseudo-random sequence. In some embodiments, for agiven value of M and/or a given value of N, there may be onepredetermined sequence table, and there may be

sequences in the predetermined sequence table. For example,

=30 or

=60. The

sequences may be divided into E groups, and within each group, there maybe F sequences. In some embodiments, the sequences in each group may beorthogonal to each other. That is, for any two different sequences Q_(i)and Q_(j) in one group, Q_(i)*Q_(j) ^(H)=0, where H may represent theconjugate transpose of a sequence. In some embodiments, the sequences indifferent groups may be orthogonal to each other. That is, for any twodifferent sequences Q_(i) and Q_(j) from different groups, Q_(i)*Q_(j)^(H)=0, where H may represent the conjugate transpose of a sequence. Insome embodiments, if group hopping is enabled, sequences for generatingthe DMRS sequences may be selected across different groups. If sequencehopping is enabled, sequences for generating the DMRS sequences may beselected within one group.

In some embodiments, a sequence B_(j) from the predetermined sequencetable T may be composed of values b_(j)(i), in which j represents asequence index within the predetermined sequence table T, j is aninteger and 0≤j≤Q−1, and Q represents the number of sequences within thepredetermined sequence table T. For example, T may be any 30 or 60. Inaddition, i may represent the index of value within the sequence B_(j),where i is an integer and 0≤i≤N−1, and where N is the sequence length.For example, N may be any one of {6, 12, 18, 24, 30}. The sequence B_(j)may be mapped to complex-valued modulation symbols d(i) according to theabove equation (1-1) or equation (1-3) or equation (1-4). In someembodiments, each b_(j)(i) in the sequence B_(j) from the predeterminedsequence table T may be multiplied with an orthogonal sequences w_(k)(i)before transformation according to the above equation (1-2), where k isan index of a sequence within a predetermined orthogonal sequence table,and k may be any one of {0, 1, 2, 3} or k may be any one of {0,1}. Thatis, the sequence for transformation according to the above equation(1-2) may be according to: b_(j)′(i)=b_(j)(i)*w_(k)(i), where i is aninteger, and 0≤i≤N−1, and where N is the sequence length.

In some embodiments, if the predetermined sequence length (that is, N)is 6, the predetermined plurality of orthogonal sequences may includeone or more of CG sequences in Table 1-A-1, Table 1-A-2, Table 1-A-3 orTable 1-A-4:

TABLE 1-A-1 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k) (5)k₀ [+1, +1, +1, +1, +1, +1] k₁ [+1, −1, +1, −1, +1, −1]

TABLE 1-A-2 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k) (5)k₀ [+1, +1, +1, +1, +1, +1] k₁ [+1, +1, +1, −1, −1, −1]

TABLE 1-A-3 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k) (5)k₀ [+1, +1, +1, +1, +1, +1] k₁ [−1, +1, −1, +1, −1, +1]

TABLE 1-A-4 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k) (5)k₀ [+1, +1, +1, +1, +1, +1] k₁ [−1, −1, −1, +1, +1, +1]

In some embodiments, if the predetermined sequence length (that is, N)is 12, the predetermined plurality of orthogonal sequences may includeone or more of CG sequences in Table 1-B-1, Table 1-B-2, Table 1-B-3,Table 1-B-4, Table 1-B-5, Table 1-B-6, Table 1-B-7 or Table 1-B-8:

TABLE 1-B-1 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(11) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₁ [+1, −1, +1,−1, +1, −1, +1, −1, +1, −1, +1, −1]

TABLE 1-B-2 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(11) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₁ [+1, +1, +1,+1, +1, +1, −1, −1, −1, −1, −1, −1]

TABLE 1-B-3 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(11) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₁ [−1, +1, −1,+1, −1, +1, −1, +1, −1, +1, −1, +1]

TABLE 1-B-4 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(11) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₁ [−1, −1, −1,−1, −1, −1, +1, +1, +1, +1, +1, +1]

TABLE 1-B-5 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(11) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₁ [+1, −1, +1,−1, +1, −1, +1, −1, +1, −1, +1, −1] k₂ [+1, +1, −1, −1, +1, +1, −1, −1,+1, +1, −1, −1] k₃ [+1, −1, −1, +1, +1, −1, −1, +1, +1, −1, −1, +1]

TABLE 1-B-6 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(11) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₁ [+1, +1, +1,+1, +1, +1, −1, −1, −1, −1, −1, −1] k₂ [+1, +1, +1, −1, −1, −1, +1, +1,+1, −1, −1, −1] k₃ [+1, +1, +1, −1, −1, −1, −1, −1, −1, +1, +1, +1]

TABLE 1-B-7 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(11) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₁ [−1, +1, −1,+1, −1, +1, −1, +1, −1, +1, −1, +1] k₂ [−1, −1, +1, +1, −1, −1, +1, +1,−1, −1, +1, +1] k₃ [−1, +1, +1, −1, −1, +1, +1, −1, −1, +1, +1, −1]

TABLE 1-B-8 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(11) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₁ [−1, −1, −1,−1, −1, −1, +1, +1, +1, +1, +1, +1] k₂ [−1, −1, −1, +1, +1, +1, −1, −1,−1, +1, +1, +1] k₃ [−1, −1, −1, +1, +1, +1, +1, +1, +1, −1, −1, −1]

In some embodiments, if the predetermined sequence length (that is, N)is 18, the predetermined plurality of orthogonal sequences may includeone or more of CG sequences in Table 1-C-1, Table 1-C-2, Table 1-C-3 or1-C-4:

TABLE 1-C-1 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(17) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1] k₁ [+1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1,−1, +1, −1]

TABLE 1-C-2 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(17) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1] k₁ [+1, +1, +1, +1, +1, +1, +1, +1, +1, −1, −1, −1, −1, −1, −1,−1, −1, −1]

TABLE 1-C-3 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(17) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1] k₁ [−1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1,+1, −1, +1]

TABLE 1-C-4 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(17) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1] k₁ [−1, −1, −1, −1, −1, −1, −1, −1, −1, +1, +1, +1, +1, +1, +1,+1, +1, +1]

In some embodiments, if the predetermined sequence length (that is, N)is 24, the predetermined plurality of orthogonal sequences may includeone or more of CG sequences in Table 1-D-1, Table 1-D-2, Table 1-D-3,Table 1-D-4, Table 1-D-5, Table 1-D-6, Table 1-D-7 or Table 1-D-8:

TABLE 1-D-1 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(23) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, +1, +1, +1] k₁ [+1, −1, +1, −1, +1, −1, +1, −1, +1,−1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1]

TABLE 1-D-2 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(23) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, +1, +1, +1] k₁ [+1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, −1, −1, −1, −1, −1, −1, −1, −1, −1, −1, −1, −1]

TABLE 1-D-3 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(23) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, +1, +1, +1] k₁ [−1, +1, −1, +1, −1, +1, −1, +1, −1,+1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1]

TABLE 1-D-4 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(23) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, +1, +1, +1] k₁ [−1, −1, −1, −1, −1, −1, −1, −1, −1,−1, −1, −1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1]

TABLE 1-D-5 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(23) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, +1, +1, +1] k₁ [+1, −1, +1, −1, +1, −1, +1, −1, +1,−1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1] k₂ [+1, +1,−1, −1, +1, +1, −1, −1, +1, +1, −1, −1, +1, +1, −1, −1, +1, +1, −1, −1,+1, +1, −1, −1] k₃ [+1, −1, −1, +1, +1, −1, −1, +1, +1, −1, −1, +1, +1,−1, −1, +1, +1, −1, −1, +1, +1, −1, −1, +1]

TABLE 1-D-6 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(23) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, +1, +1, +1] k₁ [+1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, −1, −1, −1, −1, −1, −1, −1, −1, −1, −1, −1, −1] k₂ [+1, +1,+1, +1, +1, +1, −1, −1, −1, −1, −1, −1, +1, +1, +1, +1, +1, +1, −1, −1,−1, −1, −1, −1] k₃ [+1, +1, +1, +1, +1, +1, −1, −1, −1, −1, −1, −1 −1,−1, −1, −1, −1, −1, +1, +1, +1, +1, +1, +1]

TABLE 1-D-7 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(23) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, +1, +1, +1] k₁ [−1, +1, −1, +1, −1, +1, −1, +1, −1,+1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1, −1, +1] k₂ [−1, −1,+1, +1, −1, −1, +1, +1, −1, −1, +1, +1, −1, −1, +1, +1, −1, −1, +1, +1,−1, −1, +1, +1] k₃ [−1, +1, +1, −1, −1, +1, +1, −1, −1, +1, +1, −1, −1,+1, +1, −1, −1, +1, +1, −1, −1, +1, +1, −1]

TABLE 1-D-8 Orthogonal sequences k w_(k) (0), w_(k) (1), . . . w_(k)(23) k₀ [+1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, +1, +1, +1] k₁ [−1, −1, −1, −1, −1, −1, −1, −1, −1,−1, −1, −1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1, +1] k₂ [−1, −1,−1, −1, −1, −1, +1, +1, +1, +1, +1, +1, −1, −1, −1, −1, −1, −1, +1, +1,+1, +1, +1, +1] k₃ [−1, −1, −1, −1, −1, −1, +1, +1, +1, +1, +1, +1, +1,+1, +1, +1, +1, +1, −1, −1, −1, −1, −1, −1]

In some embodiments, if the predetermined sequence length (that is, N)equals to or greater than 30, the predetermined plurality of orthogonalsequences may include one or more of CG sequences in Table 1-E-1, Table1-E-2, Table 1-E-3 or Table 1-E-4:

TABLE 1-E-1 Orthogonal sequences k w_(k) (i), 0 ≤ i ≤ N − 1 k₀ w₀ (i) =+1 k₁ w₁ (i) = (−1)^(i)

TABLE 1-E-2 Orthogonal sequences k w_(k) (i), 0 ≤ i ≤ N − 1 k₀ w₀ (i) =+1 k₁ w₁ (i) = (−1)^(i+1)

TABLE 1-E-3 Orthogonal sequences k w_(k) (l), 0 ≤ l ≤ 3, l = i mod 4, 0≤ i ≤ N − 1 k₀ [+1, +1, +1, +1] k₁ [+1, −1, +1, −1] k₂ [+1, +1, −1, −1]k₃ [+1, −1, −1, +1]

TABLE 1-E-4 Orthogonal sequences k w_(k) (l), 0 ≤ l ≤ 3, l = i mod 4, 0≤ i ≤ N − 1 k₀ [+1, +1, +1, +1] k₁ [−1, +1, −1, +1] k₂ [−1, −1, +1, +1]k₃ [−1, +1, +1, −1]

In some embodiments, in a given one of the above Tables 1-A/C/E-1/2/3/4and Tables 1-B/D-1/2/3/4/5/6/7/8, the value of k₀ may be 0 and the valueof k₁ may be 1. In some embodiments, in a given one of the above tables,the value of k₀ may be 1 and the value of k₁ may be 0. In someembodiments, in a given one of the above tables, the value of k₀ may beany one of {0, 1, 2, 3}, the value of k₁ may be any one of {0, 1, 2, 3},the value of k₂ may be any one of {0, 1, 2, 3}, and the value of k₃ maybe any one of {0, 1, 2, 3}. In addition, the values of k₀, k₁, k₂ and k₃may be different from each other. That is, all of the values of k₀, k₁,k₂ and k₃ should be included in a set {0, 1, 2, 3}.

In some embodiments, if the predetermined sequence length is 6, thepredetermined sequence table for DMRS with length 6 may include one ormore of CG sequences in Table 1-1:

TABLE 1-1 Length-6 CG sequences for π/2-BPSK CG Sequence Index {b(0), .. . , b(5)} μ₀ {0, 0, 1, 1, 1, 0} or {1, 1, 0, 0, 0, 1} μ₁ {1, 0, 0, 1,0, 0} or {0, 1, 1, 0, 1, 1} μ₂ {1, 1, 1, 0, 0, 0} or {0, 0, 0, 1, 1, 1}μ₃ {0, 1, 0, 0, 1, 0} or {1, 0, 1, 1, 0, 1} μ₄ {0, 1, 1, 1, 0, 0} or {1,0, 0, 0, 1, 1} μ₅ {1, 1, 0, 1, 1, 0} or {0, 0, 1, 0, 0, 1} μ₆ {0, 1, 1,1, 1, 0} or {1, 0, 0, 0, 0, 1} μ₇ {0, 1, 1, 0, 0, 0} or {1, 0, 0, 1, 1,1} μ₈ {0, 1, 0, 1, 1, 0} or {1, 0, 1, 0, 0, 1} μ₉ {1, 0, 0, 1, 1, 0} or{0, 1, 1, 0, 0, 1} μ₁₀ {0, 1, 1, 0, 1, 0} or {1, 0, 0, 1, 0, 1} μ₁₁ {0,0, 0, 1, 1, 0} or {1, 1, 1, 0, 0, 1} μ₁₂ {1, 1, 0, 0, 0, 0} or {0, 0, 1,1, 1, 1} μ₁₃ {1, 0, 1, 1, 0, 0} or {0, 1, 0, 0, 1, 1} μ₁₄ {0, 0, 1, 1,0, 0} or {1, 1, 0, 0, 1, 1} μ₁₅ {1, 1, 0, 0, 1, 0} or {0, 0, 1, 1, 0, 1}μ₁₆ {1, 1, 0, 1, 0, 0} or {0, 0, 1, 0, 1, 1} μ₁₇ {1, 1, 1, 1, 0, 0} or{0, 0, 0, 0, 1, 1} μ₁₈ {1, 1, 1, 0, 1, 0} or {0, 0, 0, 1, 0, 1} μ₁₉ {0,0, 0, 0, 1, 0} or {1, 1, 1, 1, 0, 1} μ₂₀ {0, 0, 1, 0, 1, 0} or {1, 1, 0,1, 0, 1} μ₂₁ {0, 0, 0, 1, 0, 0} or {1, 1, 1, 0, 1, 1} μ₂₂ {0, 1, 0, 0,0, 0} or {1, 0, 1, 1, 1, 1} μ₂₃ {1, 0, 0, 0, 0, 0} or {0, 1, 1, 1, 1, 1}μ₂₄ {1, 0, 1, 0, 0, 0} or {0, 1, 0, 1, 1, 1} μ₂₅ {1, 0, 1, 1, 1, 0} or{0, 1, 0, 0, 0, 1} μ₂₆ {0, 1, 0, 1, 0, 0} or {1, 0, 1, 0, 1, 1} μ₂₇ {0,0, 1, 0, 0, 0} or {1, 1, 0, 1, 1, 1} μ₂₈ {1, 0, 0, 0, 1, 0} or {0, 1, 1,1, 0, 1} μ₂₉ {1, 1, 1, 1, 1, 0} or {0, 0, 0, 0, 0, 1}FIG. 4A shows the performance of the CG sequences in Table 1-1. Forexample, the cross-correlation performance of the CG sequences in Table1-1 is shown in a cumulative distribution function (CDF) curve 411 inFIG. 4A, in which the horizontal axis may represent autocorrelationvalues and the vertical axis may represent cumulative distributionprobabilities. The PAPR performance (including the mean PAPR, themaximum PAPR and the minimum PAPR) of the CG sequences in Table 1-1 isshown in Table 412 in FIG. 4A. The cross-correlation performance(including the mean cross-correlation and the maximum cross-correlation)of the CG sequences in Table 1-1 is shown in Table 413 in FIG. 4A.

In some embodiments, any sequence from Table 1-1 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-1).

In some embodiments, in the above Table 1-1, L (where L is an integerand 1≤L<30) CG sequences each with an index μ_(s) (where s is an integerand 0≤s≤29) may be included in the predetermined sequence table for DMRSwith length 6. For example, μ_(s)∈[0, 29]. For two sequences with a sameindex μ_(s) in the above Table 1-1, either one of the two sequences canbe included in the predetermined sequence table for DMRS with length 6.In some embodiments, if there are more than one sequence from the aboveTable 1-1 included in the predetermined sequence table for DMRS withlength 6, the indices μ_(s1) and μ_(s2) of any two of the sequenceswhich are included in the predetermined sequence table may be different,where s1 is an integer and 0≤s1≤29, s2 is an integer and 0≤s2≤29, ands1≠s2.

In some embodiments, in the above Table 1-1, all of the 30 CG sequencesmay be included in the predetermined sequence table for DMRS with length6, and μ_(s) may represent an index of sequence, where s is an integerand 0≤s≤29. For example, μ_(s)∈[0, 29]. For each index μ_(s), either oneof the two sequences can be included in the predetermined sequence tablefor DMRS with length 6. The indices μ_(s1) and μ_(s2) of any two of thesequences which are included in the predetermined sequence table may bedifferent, where s1 is an integer and 0≤s1≤29, s2 is an integer and0≤s2≤29, and s1≠s2. That is, all the values of μ_(s) for the 30sequences that are included in the predetermined sequence table may beincluded in a set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

In some embodiments, the sequences in the above Table 1-1 cannot be usedfor DMRS of PUCCH.

In some embodiments, if the predetermined sequence length is 6, thepredetermined sequence table for DMRS with length 6 may include L (whereL is an integer and 1≤L≤30) CG sequences in Table 1-2:

TABLE 1-2 Length-6 CG sequences CG Sequence Index {b(0), . . . , b(5)}μ₀ {−3, 1, −3, 1, 1, 1} or {1, −3, 1, −3, −3, −3} μ₁ {3, −3, 1, 3, 1, 1}or {−1, 1, −3, −1, −3, −3} μ₂ {−3, 1, 1, −3, 1, 1} or {1, −3, −3, 1, −3,−3} μ₃ {1, −3, 1, −3, 1, 1} or {−3, 1, −3, 1, −3, −3} μ₄ {3, −1, 1, −3,1, 1} or {−1, 3, −3, 1, −3, −3} μ₅ {3, 1, 3, −3, 1, 1} or {−1, −3, −1,1, −3, −3} μ₆ {3, −3, 3, −3, 1, 1} or {−1, 1, −1, 1, −3, −3} μ₇ {−3, −1,−3, −1, 1, 1} or {1, 3, 1, 3, −3, −3} μ₈ {3, −3, 1, 1, 3, 1} or {−1, 1,−3, −3, −1, −3} μ₉ {3, −1, 1, 1, 3, 1} or {−1, 3, −3, −3, −1, −3} μ₁₀{−1, 1, 3, 1, 3, 1} or {3, −3, −1, −3, −1, −3} μ₁₁ {3, −3, 3, 1, 3, 1}or {−1, 1, −1, −3, −1, −3} μ₁₂ {−1, −3, 3, 1, 3, 1} or {3, 1, −1, −3,−1, −3} μ₁₃ {−3, −1, 3, 1, 3, 1} or {1, 3, −1, −3, −1, −3} μ₁₄ {3, 3,−3, 1, 3, 1} or {−1, −1, 1, −3, −1, −3} μ₁₅ {−1, 3, −3, 1, 3, 1} or {3,−1, 1, −3, −1, −3} μ₁₆ {3, −3, −3, 1, 3, 1} or {−1, 1, 1, −3, −1, −3}μ₁₇ {3, −1, −3, 1, 3, 1} or {−1, 3, 1, −3, −1, −3} μ₁₈ {−3, −1, −3, 1,3, 1} or {1, 3, 1, −3, −1, −3} μ₁₉ {3, 1, −1, 1, 3, 1} or {−1, −3, 3,−3, −1, −3} μ₂₀ {3, −3, −1, −3, 3, 1} or {−1, 1, 3, 1, −1, −3} μ₂₁ {3,−3, 3, −3, −3, 1} or {−1, 1, −1, 1, 1, −3} μ₂₂ {3, 1, 3, −1, −3, 1} or{−1, −3, −1, 3, 1, −3} μ₂₃ {3, −3, 3, 1, −1, 1} or {−1, 1, −1, −3, 3,−3} μ₂₄ {−3, 3, −1, 1, −1, 1} or {1, −1, 3, −3, 3, −3} μ₂₅ {3, −1, −1,1, −1, 1} or {−1, 3, 3, −3, 3, −3} μ₂₆ {−1, −3, 3, −3, −1, 1} or {3, 1,−1, 1, 3, −3} μ₂₇ {1, 3, −3, 1, 1, 3} or {−3, −1, 1, −3, −3, −1} μ₂₈ {1,1, −3, 3, 1, 3} or {−3, −3, 1, −1, −3, −1} μ₂₉ {1, 3, −1, −3, 1, 3} or{−3, −1, 3, 1, −3, −1} μ₃₀ {−1, −1, 1, −1, 1, 3} or {3, 3, −3, 3, −3,−1} μ₃₁ {1, 1, −3, 1, 3, 3} or {−3, −3, 1, −3, −1, −1} μ₃₂ {1, 1, 3, −1,3, 3} or {−3, −3, −1, 3, −1, −1} μ₃₃ {1, 1, 3, −1, −3, 3} or {−3, −3,−1, 3, 1, −1} μ₃₄ {1, 1, 3, 3, −1, 3} or {−3, −3, −1, −1, 3, −1} μ₃₅ {1,1, 1, −3, −1, 3} or {−3, −3, −3, 1, 3, −1} μ₃₆ {−3, 3, −3, 1, 1, −3} or{1, −1, 1, −3, −3, 1} μ₃₇ {−3, −1, −3, 1, 1, −3} or {1, 3, 1, −3, −3, 1}μ₃₈ {−3, −3, −3, 3, 1, −3} or {1, 1, 1, −1, −1, 1} μ₃₉ {1, 1, −3, −3, 1,−3} or {−3, −3, 1, 1, −3, 1} μ₄₀ {−3, −3, 1, −3, 3, −3} or {1, 1, −3, 1,−1, 1} μ₄₁ {1, 1, 1, −1, 3, −3} or {−3, −3, −3, 3, −1, 1} μ₄₂ {−3, 3,−1, −1, 3, −3} or {1, −1, 3, 3, −1, 1} μ₄₃ {−3, 1, 3, 1, −3, −3} or {1,−3, −1, −3, 1, 1} μ₄₄ {−3, −1, −3, 1, −3, −3} or {1, 3, 1, −3, 1, 1} μ₄₅{−3, 1, 3, −3, −3, −3} or {1, −3, −1, 1, 1, 1} μ₄₆ {−3, 1, −1, −3, −3,−3} or {1, −3, 3, 1, 1, 1} μ₄₇ {−3, −3, −1, 1, −1, −3} or {1, 1, 3, −3,3, 1} μ₄₈ {1, 1, 1, 3, −1, −3} or {−3, −3, −3, −1, 3, 1} μ₄₉ {−3, −1, 3,3, −1, −3} or {1, 3, −1, −1, 3, 1} μ₅₀ {−3, 1, 1, −3, −1, −3} or {1, −3,−3, 1, 3, 1} μ₅₁ {−3, −1, 1, −3, 1, −1} or {1, 3, −3, 1, −3, 3} μ₅₂ {1,1, 1, −3, 3, −1} or {−3, −3, −3, 1, −1, 3} μ₅₃ {1, 1, −1, −1, 3, −1} or{−3, −3, 3, 3, −1, 3} μ₅₄ {−3, −1, −1, −1, 3, −1} or {1, 3, 3, 3, −1, 3}μ₅₅ {−3, −3, −3, 1, −3, −1} or {1, 1, 1, −3, 1, 3} μ₅₆ {1, 1, −1, 3, −3,−1} or {−3, −3, 3, −1, 1, 3} μ₅₇ {−3, 1, −3, −3, −3, −1} or {1, −3, 1,1, 1, 3} μ₅₈ {1, 1, −3, 1, −1, −1} or {−3, −3, 1, −3, 3, 3} μ₅₉ {1, 1,−1, 3, −1, −1} or {−3, −3, 3, −1, 3, 3}

In some embodiments, any sequence from Table 1-2 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-3).

In some embodiments, in the above Table 1-2, L (where L is an integerand 1≤L≤30) CG sequences each with an index μ_(s) (where s is an integerand 0≤s≤59) may be included in the predetermined sequence table for DMRSwith length 6. For example, μ_(s)∈[0, 29]. For two sequences with a sameindex μ_(s) in the above Table 1-2, either one of the two sequences canbe included in the predetermined sequence table for DMRS with length 6.In some embodiments, if there are more than one sequences from the aboveTable 1-2 that are included in the predetermined sequence table for DMRSwith length 6, the indices μ_(s1) and μ_(s2) of any two of the sequenceswhich are included in the predetermined sequence table may be different.For example, s1 is an integer and 0≤s1≤59, s2 is an integer and 0≤s2≤59,and s1≠s2.

In some embodiments, in the above Table 1-2, 30 CG sequences may beincluded in the predetermined sequence table for DMRS with length 6, andμ_(s) may represent an index of a sequence within the predeterminedsequence table for DMRS with length 6, where s is an integer and 0≤s≤59.In the above Table 1-2, for example, μ_(s)∈[0, 29]. For two sequenceswith a same index μ_(s) in the above Table 1-2, either one of the twosequences can be included in the predetermined sequence table for DMRSwith length 6. In some embodiments, if there are more than one sequencesfrom the above Table 1-2 that are included in the predetermined sequencetable for DMRS with length 6, the indices μ_(s1) and μ_(s2) of any twoof the sequences which are included in the predetermined sequence tablemay be different. For example, s1 is an integer and 0≤s1≤59, s2 is aninteger and 0≤s2≤59, and s1≠s2. That is, all the values of μ_(s) for the30 sequences that are included in the predetermined sequence table maybe included in a set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

In some embodiments, in the above Table 1-2, L (where L is an integerand 1≤L≤30) CG sequences from the sequences each with an index μ_(s)(where s is an integer and 0≤s≤29) may be included in the predeterminedsequence table for DMRS with length 6. For example, μ_(s)∈[0, 29]. Fortwo sequences with a same index μ_(s) in the above Table 1-2, either oneof the two sequences can be included in the predetermined sequence tablefor DMRS with length 6. In some embodiments, if there are more than onesequence within the sequences with the index μ_(s) (where s is aninteger and 0≤s≤29) from the above Table 1-2 included in thepredetermined sequence table for DMRS with length 6, the indices μ_(s1)and μ_(s2) of any two of the sequences which are included in thepredetermined sequence table may be different, where s1 is an integerand 0≤s1≤29, s2 is an integer and 0≤s2≤29, and s1≠s2.

In some embodiments, in the above Table 1-2, all of the 30 CG sequenceseach with a different index μ_(s) (where s is an integer and 0≤s≤29) maybe included in the predetermined sequence table for DMRS with length 6.For example, μ_(s)∈[0, 29]. For each index μ_(s), either one of the twosequences can be included in the predetermined sequence table for DMRSwith length 6. The indices μ_(s1) and μ_(s2) of any two of the sequenceswhich are included in the predetermined sequence table may be different,where s1 is an integer and 0≤s1≤29, s2 is an integer and 0≤s2≤29, ands1≠s2. That is, all the values of μ_(s) for the 30 sequences that areincluded in the predetermined sequence table may be included in a set{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

In some embodiments, in the above Table 1-2, L (where L is an integerand 1≤L≤30) CG sequences from the sequences each with an index μ_(s)(where s is an integer and 30≤s≤59) may be included in the predeterminedsequence table for DMRS with length 6. For example, μ_(s)∈[0, 29]. Fortwo sequences with a same index μ_(s) in the above Table 1-2, either oneof the two sequences can be included in the predetermined sequence tablefor DMRS with length 6. In some embodiments, if there are more than onesequences within the sequences with index μ_(s) (s is an integer and30≤s≤59) from the above Table 1-2 included in the predetermined sequencetable for DMRS with length 6, the indices μ_(s1) and μ_(s2) of any twoof the sequences which are included in the predetermined sequence tablemay be different, where s1 is an integer and 30≤s1≤59, s2 is an integerand 30≤s2≤59, and s1≠s2.

In some embodiments, in the above Table 1-2, all of the 30 CG sequenceseach with a different index μ_(s) (where s is an integer and 30≤s≤59)may be included in the predetermined sequence table for DMRS with length6. For example, μ_(s)∈[0, 29]. For each index μ_(s), either one of thetwo sequences can be included in the predetermined sequence table forDMRS with length 6. The indices μ_(s1) and μ_(s2) of any two of thesequences which are included in the predetermined sequence table may bedifferent, where s1 is an integer and 30≤s1≤59, s2 is an integer and30≤s2≤59, and s1≠s2. That is, all the values of μ_(s) for the 30sequences that are included in the predetermined sequence table may beincluded in a set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

In some embodiments, if the predetermined sequence length is 6, thepredetermined sequence table for DMRS with length 6 may include L (whereL is an integer and 1≤L≤30) CG sequences in Table 1-3:

TABLE 1-3 Length-6 CG sequences CG Sequence Index {b(0), . . . , b(5)}μ₀ {3, −5, −1, −7, 3, 1} or {−5, 3, 7, 1, −5, −7} μ₁ {−3, 1, −3, −7, 5,1} or {5, −7, 5, 1, −3, −7} μ₂ {5, −7, −3, −7, 5, 1} or {−3, 1, 5, 1,−3, −7} μ₃ {7, −3, 7, −1, 5, 1} or {−1, 5, −1, 7, −3, −7} μ₄ {−7, −1,−5, 1, 7, 1} or {1, 7, 3, −7, −1, −7} μ₅ {−5, 1, 7, 3, −7, 1} or {3, −7,−1, −5, 1, −7} μ₆ {−3, 3, −5, 5, −5, 1} or {5, −5, 3, −3, 3, −7} μ₇ {−3,−7, 5, 1, −3, 1} or {5, 1, −3, −7, 5, −7} μ₈ {5, −1, −3, 1, −3, 1} or{−3, 7, 5, −7, 5, −7} μ₉ {5, 1, 5, −7, −3, 1} or {−3, −7, −3, 1, 5, −7}μ₁₀ {5, 1, −3, −7, −3, 1} or {−3, −7, 5, 1, 5, −7} μ₁₁ {−7, −1, −7, 1,7, 3} or {1, 7, 1, −7, −1, −5} μ₁₂ {−5, 1, −3, 3, −7, 3} or {3, −7, 5,−5, 1, −5} μ₁₃ {−3, 3, −7, 5, −5, 3} or {5, −5, 1, −3, 3, −5} μ₁₄ {−1,5, −3, 7, −3, 3} or {7, −3, 5, −1, 5, −5} μ₁₅ {1, −5, −1, 3, −1, 3} or{−7, 3, 7, −5, 7, −5} μ₁₆ {1, −5, −1, −5, −1, 3} or {−7, 3, 7, 3, 7, −5}μ₁₇ {−5, −1, −5, 5, 1, 5} or {3, 7, 3, −3, −7, −3} μ₁₈ {−1, 3, 7, −7, 1,5} or {7, −5, −1, 1, −7, −3} μ₁₉ {1, −3, −7, −3, 1, 5} or {−7, 5, 1, 5,−7, −3} μ₂₀ {−5, 1, −5, 3, −7, 5} or {3, −7, 3, −5, 1, −3} μ₂₁ {−3, 3,−1, 5, −5, 5} or {5, −5, 7, −3, 3, −3} μ₂₂ {3, 7, 3, 7, −5, 5} or {−5,−1, −5, −1, 3, −3} μ₂₃ {3, 7, −5, 7, −5, 5} or {−5, −1, 3, −1, 3, −3}μ₂₄ {−1, 5, −5, 7, −3, 5} or {7, −3, 3, −1, 5, −3} μ₂₅ {1, 7, −1, −7,−1, 5} or {−7, −1, 7, 1, 7, −3} μ₂₆ {3, −7, 1, −5, 1, 7} or {−5, 1, −7,3, −7, −1} μ₂₇ {−5, −1, 3, 7, 3, 7} or {3, 7, −5, −1, −5, −1} μ₂₈ {−5,−1, −5, 7, 3, 7} or {3, 7, 3, −1, −5, −1} μ₂₉ {−5, 7, −5, −7, 3, 7} or{3, −1, 3, 1, −5, −1} μ₃₀ {3, 7, 5, −1, 3, 7} or {−5, −1, −3, 7, −5, −1}μ₃₁ {−3, 3, −3, 5, −5, 7} or {5, −5, 5, −3, 3, −1} μ₃₂ {−5, −1, −7, 7,−5, 7} or {3, 7, 1, −1, 3, −1} μ₃₃ {−1, 5, 1, 7, −3, 7} or {7, −3, −7,−1, 5, −1} μ₃₄ {1, 7, −3, −7, −1, 7} or {−7, −1, 5, 1, 7, −1} μ₃₅ {3,−7, −1, −5, 1, −7} or {−5, 1, 7, 3, −7, 1} μ₃₆ {−1, 5, −1, 7, −3, −7} or{7, −3, 7, −1, 5, 1} μ₃₇ {1, 7, 3, −7, −1, −7} or {−7, −1, −5, 1, 7, 1}μ₃₈ {3, −7, 5, −5, 1, −5} or {−5, 1, −3, 3, −7, 3} μ₃₉ {5, −5, 1, −3, 3,−5} or {−3, 3, −7, 5, −5, 3} μ₄₀ {7, −3, 5, −1, 5, −5} or {−1, 5, −3, 7,−3, 3} μ₄₁ {1, 7, 1, −7, −1, −5} or {−7, −1, −7, 1, 7, 3} μ₄₂ {7, 3, 7,−5, −1, −5} or {−1, −5, −1, 3, 7, 3} μ₄₃ {−7, 5, 1, 5, 1, −3} or {1, −3,−7, −3, −7, 5} μ₄₄ {−7, −3, 1, 5, 1, −3} or {1, 5, −7, −3, −7, 5} μ₄₅{3, −7, 3, −5, 1, −3} or {−5, 1, −5, 3, −7, 5} μ₄₆ {5, −5, 7, −3, 3, −3}or {−3, 3, −1, 5, −5, 5} μ₄₇ {7, −3, 3, −1, 5, −3} or {−1, 5, −5, 7, −3,5} μ₄₈ {1, 5, −1, 3, −5, −3} or {−7, −3, 7, −5, 3, 5} μ₄₉ {−7, −5, −3,−7, −5, −3} or {1, 3, 5, 1, 3, 5} μ₅₀ {1, 3, −1, 1, 3, −1} or {−7, −5,7, −7, −5, 7} μ₅₁ {5, −5, 5, −3, 3, −1} or {−3, 3, −3, 5, −5, 7} μ₅₂ {7,−3, −7, −1, 5, −1} or {−1, 5, 1, 7, −3, 7} μ₅₃ {−7, −1, 5, 1, 7, −1} or{1, 7, −3, −7, −1, 7} μ₅₄ {−5, 1, −7, 3, −7, −1} or {3, −7, 1, −5, 1, 7}

In some embodiments, any sequence from Table 1-3 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-4).

In some embodiments, the sequences in the above Table 1-1, Table 1-2and/or Table 1-3 cannot be used for DMRS of PUCCH.

In some embodiments, in the above Table 1-3, L (where L is an integerand 1≤L≤30) CG sequences each with an index μ_(s) (where s is an integerand 0≤s≤54) may be included in the predetermined sequence table for DMRSwith length 6. For example, μ_(s)∈[0, 29]. For two sequences with a sameindex μ_(s) in the above Table 1-3, either one of the two sequences canbe included in the predetermined sequence table for DMRS with length 6.In some embodiments, if there are more than one sequences from the aboveTable 1-3 that are included in the predetermined sequence table for DMRSwith length 6, the indices μ_(s1) and μ_(s2) of any two of the sequenceswhich are included in the predetermined sequence table may be different,where s1 is an integer and 0≤s1≤54, s2 is an integer and 0≤s2≤54, ands1≠s2.

In some embodiments, in the above Table 1-3, 30 CG sequences each withan index μ_(s) (where s is an integer and 0≤s≤54) may be included in thepredetermined sequence table for DMRS with length 6. For example,μ_(s)∈[0, 29]. For each index μ_(s), either one of the two sequences canbe included in the predetermined sequence table for DMRS with length 6.The indices μ_(s1) and μ_(s2) of any two of the sequences which areincluded in the predetermined sequence table may be different, where s1is an integer and 0≤s1≤54, s2 is an integer and 0≤s2≤54, and s1≠s2. Thatis, all the values of μ_(s) for the 30 sequences that are included inthe predetermined sequence table may be included in a set {0, 1, 2, 3,4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,23, 24, 25, 26, 27, 28, 29}.

In some embodiments, in the above Table 1-3, L (where L is an integerand 1≤L≤10) CG sequences each with an index μ_(s) (where s∈{0, 8, 15,16, 17, 22, 23, 29, 30, 32}) may be included in the predeterminedsequence table for DMRS with length 6. For example, μ_(s)∈[0, 29]. Fortwo sequences with a same index μ_(s) in the above Table 1-3, either oneof the two sequences can be included in the predetermined sequence tablefor DMRS with length 6. In some embodiments, if there are more than onesequences each with an index μ_(s) (where s∈{0, 8, 15, 16, 17, 22, 23,29, 30, 32}) from the above Table 1-3 that are included in thepredetermined sequence table for DMRS with length 6, the indices μ_(s1)and μ_(s2) of any two of the sequences which are included in thepredetermined sequence table may be different, where s1∈{0, 8, 15, 16,17, 22, 23, 29, 30, 32} and s2∈{0, 8, 15, 16, 17, 22, 23, 29, 30, 32}.

In some embodiments, if the predetermined sequence length is 12, thedetermined plurality of CG sequences may include one or more of CGsequences in Table 2:

TABLE 2 Length-12 CG sequences for π/2-BPSK CG Sequence Index {b(0), . .. , b(11)} μ₀ {0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0} or {1, 1, 0, 1, 1, 0,1, 1, 0, 1, 0, 1} μ₁ {1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0} or {0, 0, 0,0, 0, 1, 1, 1, 0, 0, 0, 1} μ₂ {1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0} or{0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1} μ₃ {0, 0, 0, 0, 1, 1, 1, 0, 1, 1,1, 0} or {1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1} μ₄ {0, 1, 0, 0, 1, 1, 1,1, 1, 0, 1, 0} or {1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1} μ₅ {1, 0, 1, 0,0, 1, 1, 1, 0, 1, 0, 0} or {0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1} μ₆ {0,0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0} or {1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1}μ₇ {1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0} or {0, 1, 1, 1, 0, 1, 1, 1, 0,0, 0, 1} μ₈ {0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0} or {1, 1, 0, 0, 0, 0,0, 1, 1, 0, 1, 1} μ₉ {0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0} or {1, 1, 0,1, 1, 1, 0, 1, 1, 1, 0, 1} μ₁₀ {1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0} or{0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1} μ₁₁ {0, 1, 1, 1, 0, 0, 0, 0, 0, 1,0, 0} or {1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1} μ₁₂ {0, 1, 1, 1, 1, 1, 0,0, 0, 0, 1, 0} or {1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1} μ₁₃ {0, 1, 0, 0,1, 0, 0, 1, 0, 1, 0, 0} or {1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1} μ₁₄ {0,1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0} or {1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1}μ₁₅ {1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0} or {0, 0, 0, 1, 0, 0, 0, 1, 0,0, 0, 1} μ₁₆ {1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0} or {0, 1, 1, 0, 1, 1,1, 0, 1, 0, 1, 1} μ₁₇ {0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0} or {1, 0, 1,1, 0, 1, 1, 1, 0, 1, 1, 1} μ₁₈ {1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0} or{0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1} μ₁₉ {0, 1, 0, 1, 0, 0, 1, 0, 1, 1,1, 0} or {1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1} μ₂₀ {1, 1, 1, 0, 0, 0, 0,0, 1, 0, 0, 0} or {0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1} μ₂₁ {1, 0, 1, 1,1, 1, 0, 1, 1, 0, 0, 0} or {0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1} μ₂₂ {0,0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0} or {1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1}μ₂₃ {0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0} or {1, 1, 0, 0, 0, 1, 1, 1, 0,1, 1, 1} μ₂₄ {1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0} or {0, 0, 1, 0, 0, 0,0, 0, 0, 1, 1, 1} μ₂₅ {1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0} or {0, 0, 0,1, 0, 1, 1, 0, 1, 1, 0, 1} μ₂₆ {0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0} or{1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1} μ₂₇ {0, 1, 0, 0, 0, 1, 1, 1, 1, 1,0, 0} or {1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1} μ₂₈ {1, 0, 0, 0, 1, 1, 1,0, 0, 0, 0, 0} or {0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1} μ₂₉ {0, 1, 1, 1,1, 0, 1, 1, 1, 1, 0, 0} or {1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1}FIG. 4B shows the performance of the CG sequences in Table 2. Forexample, the cross-correlation performance of the CG sequences in Table2 is shown in a cumulative distribution function (CDF) curve 421 in FIG.4B, in which the horizontal axis may represent autocorrelation valuesand the vertical axis may represent cumulative distributionprobabilities. The PAPR performance (including the mean PAPR, themaximum PAPR and the minimum PAPR) of the CG sequences in Table 2 isshown in Table 422 in FIG. 4B. The cross-correlation performance(including the mean cross-correlation and the maximum cross-correlation)of the CG sequences in Table 2 is shown in Table 423 in FIG. 4B.

In some embodiments, any sequence from Table 2 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-1).

In some embodiments, in the above Table 2, all of the 30 CG sequencesmay be included in the predetermined sequence table for DMRS with length12, and μ_(s) may represent an index of a sequence within thepredetermined sequence table, where s is an integer and 0≤s≤29. Forexample, μ_(s)∈[0, 29]. For each index μ_(s), either one of the twosequences can be included in the predetermined sequence table for DMRSwith length 12. The indices μ_(s1) and μ_(s2) of any two of thesequences which are included in the predetermined sequence table may bedifferent, where s1 is an integer and 0≤s1≤29, s2 is an integer and0≤s2≤29, and s1≠s2. That is, all the values of μ_(s) may be included ina set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

Alternatively, in some embodiments, if the predetermined sequence lengthis 12, the determined plurality of CG sequences may include one or moreof CG sequences in Table 3-1:

TABLE 3-1 Length-12 CG sequences for π/2-BPSK CG Sequence Index {b(0), .. . , b(11)} μ₀ {0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1} or {1, 0, 0, 0, 0,0, 0, 1, 1, 1, 0, 0} μ₁ {0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1} or {1, 0,0, 1, 0, 1, 0, 1, 1, 1, 0, 0} μ₂ {1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0} or{0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1} μ₃ {1, 1, 1, 1, 0, 1, 1, 0, 1, 0,0, 0} or {0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1} μ₄ {0, 1, 1, 0, 1, 0, 1,1, 1, 0, 1, 1} or {1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0} μ₅ {0, 1, 1, 1,0, 1, 1, 1, 0, 1, 1, 1} or {1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0} μ₆ {0,0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1} or {1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0}μ₇ {0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1} or {1, 1, 1, 0, 0, 0, 0, 0, 1,1, 1, 0} μ₈ {1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1} or {0, 1, 1, 1, 0, 1,1, 1, 0, 0, 0, 0} μ₉ {1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1} or {0, 1, 1,1, 0, 1, 1, 1, 1, 1, 0, 0} μ₁₀ {1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1} or{0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0} μ₁₁ {0, 1, 1, 0, 0, 0, 0, 0, 1, 1,0, 1} or {1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0} μ₁₂ {0, 0, 0, 0, 0, 1, 1,0, 0, 0, 1, 1} or {1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0} μ₁₃ {0, 0, 0, 1,0, 0, 1, 1, 1, 0, 0, 1} or {1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0} μ₁₄ {0,0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1} or {1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0}μ₁₅ {1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0} or {0, 0, 1, 1, 1, 1, 1, 0, 0,0, 0, 1} μ₁₆ {0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0} or {1, 0, 0, 0, 0, 0,1, 1, 0, 1, 1, 1} μ₁₇ {1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0} or {0, 0, 1,0, 1, 0, 0, 1, 1, 1, 0, 1} μ₁₈ {1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0} or{0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1} μ₁₉ {1, 0, 1, 0, 0, 1, 0, 0, 1, 0,1, 0} or {0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1} μ₂₀ {1, 0, 1, 1, 0, 0, 0,1, 0, 0, 0, 1} or {0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0} μ₂₁ {1, 0, 1, 0,1, 1, 0, 0, 1, 0, 0, 1} or {0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0} μ₂₂ {1,0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0} or {0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1}μ₂₃ {1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1} or {0, 0, 0, 0, 1, 0, 0, 0, 1,0, 1, 0} μ₂₄ {0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1} or {1, 1, 1, 0, 1, 1,1, 1, 0, 1, 0, 0} μ₂₅ {0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1} or {1, 0, 0,1, 1, 1, 0, 1, 1, 1, 1, 0} μ₂₆ {0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1} or{1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0} μ₂₇ {1, 0, 1, 0, 0, 0, 0, 1, 0, 0,0, 1} or {0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0} μ₂₈ {0, 0, 0, 1, 0, 0, 0,1, 1, 1, 1, 0} or {1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1} μ₂₉ {1, 1, 0, 0,0, 0, 1, 0, 0, 0, 1, 1} or {0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0}FIG. 4C shows the performance of the CG sequences in Table 3-1. Forexample, the cross-correlation performance of the CG sequences in Table3-1 is shown in a cumulative distribution function (CDF) curve 431 inFIG. 4C, in which the horizontal axis may represent autocorrelationvalues and the vertical axis may represent cumulative distributionprobabilities. The PAPR performance (including the mean PAPR, themaximum PAPR and the minimum PAPR) of the CG sequences in Table 3-1 isshown in Table 432 in FIG. 4C. The cross-correlation performance(including the mean cross-correlation and the maximum cross-correlation)of the CG sequences in Table 3-1 is shown in Table 433 in FIG. 4C.

In some embodiments, any sequence from Table 3-1 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-1).

In some embodiments, in either one of the above Table 2 or Table 3-1, L(where L is an integer and 1≤L<30) CG sequences may be included in thepredetermined sequence table for DMRS with length 12, and μ_(s) mayrepresent an index of a sequence within the predetermined sequencetable, where s is an integer and 0≤s≤29. In either one of the aboveTable 2 or Table 3-1, μ_(s)∈[0, 29]. In some embodiments, in either oneof the above Table 2 or Table 3-1, for each index μ_(s), either one ofthe two sequences can be included in the predetermined sequence tablefor DMRS with length 12. In some embodiments, if there are more than onesequences from either one of the above Table 2 or Table 3-1 that areincluded in the predetermined sequence table for DMRS with length 12,the indices μ_(s1) and μ_(s2) of any two of the sequences which areincluded in the predetermined sequence table may be different, where s1is an integer and 0≤s1≤29, s2 is an integer and 0≤s2≤29, and s1≠s2.

In some embodiments, in the above Table 3-1, all of the 30 CG sequencesmay be included in the predetermined sequence table for DMRS with length12, and/4 may represent an index of a sequence within the predeterminedsequence table, where s is an integer and 0≤s≤29. For example, μ_(s)∈[0,29]. For each index μ_(s), either one of the two sequences can beincluded in the predetermined sequence table for DMRS with length 12.The indices μ_(s1) and μ_(s2) of any two of the sequences which areincluded in the predetermined sequence table may be different, where s1is an integer and 0≤s1≤29, s2 is an integer and 0≤s2≤29, and s1≠s2. Thatis, all the values of/4 may be included in a set {0, 1, 2, 3, 4, 5, 6,7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,26, 27, 28, 29}.

Alternatively, in some embodiments, if the predetermined sequence lengthis 12, the predetermined sequence table for DMRS with length 12 mayinclude L (where L is an integer and 1≤L≤30) CG sequences in Table 3-2:

TABLE 3-2 Length-12 CG sequences for π/2-BPSK CG Sequence Index {b(0), .. . , b(11)} μ₀ {1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0} or {0, 1, 0, 0, 0,1, 1, 1, 1, 1, 1, 1} μ₁ {1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0} or {0, 0,0, 1, 1, 0, 1, 1, 1, 1, 1, 1} μ₂ {1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0} or{0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1} μ₃ {0, 1, 1, 1, 0, 1, 0, 0, 0, 0,0, 0} or {1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1} μ₄ {0, 1, 0, 0, 1, 1, 0,0, 0, 0, 0, 0} or {1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1} μ₅ {1, 1, 1, 1,1, 1, 0, 0, 0, 0, 0, 0} or {0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1} μ₆ {1,0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0} or {0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1}μ₇ {0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0} or {1, 0, 0, 0, 0, 1, 0, 1, 1,1, 1, 1} μ₈ {1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0} or {0, 0, 0, 0, 1, 0,0, 1, 1, 1, 1, 1} μ₉ {1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0} or {0, 1, 1,1, 0, 0, 0, 1, 1, 1, 1, 1} μ₁₀ {1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0} or{0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1} μ₁₁ {1, 0, 0, 1, 1, 1, 0, 1, 0, 0,0, 0} or {0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1} μ₁₂ {0, 0, 1, 0, 0, 0, 1,1, 0, 0, 0, 0} or {1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1} μ₁₃ {0, 1, 1, 0,1, 0, 1, 1, 0, 0, 0, 0} or {1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1} μ₁₄ {0,1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0} or {1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1}μ₁₅ {0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0} or {1, 0, 0, 1, 0, 0, 0, 0, 1,1, 1, 1} μ₁₆ {1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0} or {0, 0, 0, 1, 1, 1,1, 1, 0, 1, 1, 1} μ₁₇ {0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0} or {1, 0, 1,1, 0, 1, 1, 1, 0, 1, 1, 1} μ₁₈ {1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0} or{0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1} μ₁₉ {0, 0, 1, 1, 1, 0, 0, 0, 1, 0,0, 0} or {1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1} μ₂₀ {0, 1, 1, 1, 1, 1, 0,0, 1, 0, 0, 0} or {1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1} μ₂₁ {1, 1, 0, 1,1, 0, 1, 0, 1, 0, 0, 0} or {0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1} μ₂₂ {1,1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0} or {0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1}μ₂₃ {1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0} or {0, 1, 0, 0, 1, 0, 0, 1, 0,1, 1, 1} μ₂₄ {1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0} or {0, 0, 0, 0, 1, 0,0, 1, 0, 1, 1, 1} μ₂₅ {1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0} or {0, 0, 1,1, 1, 0, 1, 0, 0, 1, 1, 1} μ₂₆ {0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0} or{1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1} μ₂₇ {1, 0, 1, 1, 1, 1, 0, 1, 1, 0,0, 0} or {0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1} μ₂₈ {0, 1, 0, 0, 1, 1, 1,1, 1, 0, 0, 0} or {1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1} μ₂₉ {0, 1, 1, 0,1, 1, 1, 1, 1, 0, 0, 0} or {1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1} μ₃₀ {1,1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0} or {0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1}μ₃₁ {0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0} or {1, 0, 0, 0, 1, 1, 1, 1, 1,0, 1, 1} μ₃₂ {0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0} or {1, 0, 1, 0, 0, 0,1, 1, 1, 0, 1, 1} μ₃₃ {0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0} or {1, 0, 1,1, 1, 0, 0, 1, 1, 0, 1, 1} μ₃₄ {1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0} or{0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1} μ₃₅ {0, 0, 1, 1, 1, 1, 1, 0, 0, 1,0, 0} or {1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1} μ₃₆ {1, 0, 1, 0, 0, 0, 0,1, 0, 1, 0, 0} or {0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1} μ₃₇ {1, 0, 0, 1,0, 0, 0, 1, 0, 1, 0, 0} or {0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1} μ₃₈ {0,1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0} or {1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1}μ₃₉ {0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0} or {1, 1, 0, 0, 0, 1, 1, 0, 1,0, 1, 1} μ₄₀ {1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0} or {0, 0, 0, 0, 0, 1,1, 0, 1, 0, 1, 1} μ₄₁ {1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0} or {0, 1, 0,1, 0, 0, 1, 0, 1, 0, 1, 1} μ₄₂ {0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0} or{1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1} μ₄₃ {1, 0, 1, 0, 1, 0, 1, 1, 0, 1,0, 0} or {0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1} μ₄₄ {1, 0, 1, 0, 0, 1, 1,1, 0, 1, 0, 0} or {0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1} μ₄₅ {1, 1, 1, 0,0, 1, 1, 1, 0, 1, 0, 0} or {0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1} μ₄₆ {1,1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0} or {0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1}μ₄₇ {0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0} or {1, 0, 1, 0, 0, 0, 1, 1, 0,0, 1, 1} μ₄₈ {0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0} or {1, 0, 0, 0, 1, 1,0, 1, 0, 0, 1, 1} μ₄₉ {0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0} or {1, 0, 1,1, 0, 1, 0, 1, 0, 0, 1, 1} μ₅₀ {0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0} or{1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1} μ₅₁ {0, 0, 1, 0, 0, 1, 1, 0, 1, 1,0, 0} or {1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1} μ₅₂ {0, 0, 0, 1, 1, 1, 1,0, 1, 1, 0, 0} or {1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1} μ₅₃ {0, 0, 0, 0,1, 0, 1, 1, 1, 1, 0, 0} or {1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1} μ₅₄ {0,0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0} or {1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1}μ₅₅ {0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0} or {1, 0, 0, 0, 0, 1, 0, 0, 0,0, 1, 1} μ₅₆ {1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0} or {0, 1, 1, 1, 1, 0,0, 0, 0, 0, 1, 1} μ₅₇ {0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0} or {1, 0, 1,1, 1, 0, 0, 0, 0, 0, 1, 1} μ₅₈ {0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0} or{1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1} μ₅₉ {1, 0, 0, 1, 0, 1, 1, 1, 1, 1,0, 0} or {0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1} μ₆₀ {0, 0, 1, 1, 1, 1, 1,1, 1, 1, 0, 0} or {1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1} μ₆₁ {0, 1, 1, 1,1, 1, 0, 0, 0, 0, 1, 0} or {1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1} μ₆₂ {0,0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0} or {1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1}μ₆₃ {1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0} or {0, 1, 1, 0, 1, 1, 0, 1, 1,1, 0, 1} μ₆₄ {0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0} or {1, 0, 1, 1, 1, 1,1, 0, 1, 1, 0, 1} μ₆₅ {1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0} or {0, 0, 0,1, 0, 1, 1, 0, 1, 1, 0, 1} μ₆₆ {0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0} or{1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1} μ₆₇ {1, 1, 1, 0, 0, 1, 0, 1, 0, 0,1, 0} or {0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1} μ₆₈ {0, 0, 1, 0, 1, 1, 0,1, 0, 0, 1, 0} or {1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1} μ₆₉ {0, 0, 1, 0,1, 0, 1, 1, 0, 0, 1, 0} or {1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1} μ₇₀ {1,1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0} or {0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1}μ₇₁ {0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0} or {1, 1, 1, 0, 0, 1, 0, 0, 1,1, 0, 1} μ₇₂ {1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0} or {0, 0, 0, 1, 1, 0,0, 0, 1, 1, 0, 1} μ₇₃ {1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0} or {0, 0, 1,0, 1, 0, 0, 0, 1, 1, 0, 1} μ₇₄ {0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0} or{1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1} μ₇₅ {0, 1, 1, 1, 0, 1, 0, 0, 1, 0,1, 0} or {1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1} μ₇₆ {0, 1, 0, 1, 1, 1, 0,0, 1, 0, 1, 0} or {1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1} μ₇₇ {0, 1, 0, 1,0, 1, 1, 0, 1, 0, 1, 0} or {1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1} μ₇₈ {1,1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0} or {0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1}μ₇₉ {1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0} or {0, 0, 1, 0, 0, 1, 1, 0, 0,1, 0, 1} μ₈₀ {1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0} or {0, 0, 1, 1, 1, 0,1, 0, 0, 1, 0, 1} μ₈₁ {0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0} or {1, 1, 0,0, 1, 1, 0, 0, 0, 1, 0, 1} μ₈₂ {0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0} or{1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1} μ₈₃ {1, 0, 1, 1, 0, 0, 0, 0, 0, 1,1, 0} or {0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1} μ₈₄ {1, 1, 1, 1, 0, 0, 0,0, 0, 1, 1, 0} or {0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1} μ₈₅ {1, 1, 0, 0,1, 0, 0, 0, 0, 1, 1, 0} or {0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1} μ₈₆ {1,0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0} or {0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1}μ₈₇ {1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0} or {0, 0, 0, 0, 1, 0, 1, 1, 1,0, 0, 1} μ₈₈ {1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0} or {0, 0, 0, 0, 1, 1,0, 1, 1, 0, 0, 1} μ₈₉ {1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0} or {0, 1, 0,0, 1, 0, 0, 1, 1, 0, 0, 1} μ₉₀ {1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0} or{0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1} μ₉₁ {1, 0, 0, 0, 1, 1, 0, 1, 0, 1,1, 0} or {0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1} μ₉₂ {0, 0, 1, 0, 1, 1, 0,1, 0, 1, 1, 0} or {1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1} μ₉₃ {0, 0, 0, 0,1, 0, 1, 1, 0, 1, 1, 0} or {1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1} μ₉₄ {0,0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0} or {1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1}μ₉₅ {0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0} or {1, 0, 1, 1, 0, 0, 0, 0, 1,0, 0, 1} μ₉₆ {1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0} or {0, 1, 0, 1, 1, 1,1, 1, 0, 0, 0, 1} μ₉₇ {0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0} or {1, 0, 1,0, 1, 1, 1, 1, 0, 0, 0, 1} μ₉₈ {1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0} or{0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1} μ₉₉ {1, 1, 1, 1, 1, 0, 0, 0, 1, 1,1, 0} or {0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1} μ₁₀₀ {0, 1, 0, 1, 0, 0, 1,0, 1, 1, 1, 0} or {1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1} μ₁₀₁ {0, 0, 0, 0,1, 1, 1, 0, 1, 1, 1, 0} or {1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1} μ₁₀₂ {1,1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0} or {0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1}μ₁₀₃ {1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0} or {0, 0, 0, 1, 0, 0, 0, 1, 0,0, 0, 1} μ₁₀₄ {1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0} or {0, 1, 0, 0, 1, 1,1, 0, 0, 0, 0, 1} μ₁₀₅ {0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0} or {1, 1, 1,1, 0, 0, 1, 0, 0, 0, 0, 1} μ₁₀₆ {0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0} or{1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1} μ₁₀₇ {0, 0, 0, 0, 0, 1, 1, 1, 1, 1,1, 0} or {1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1} μ₁₀₈ {0, 1, 1, 1, 0, 0, 1,1, 0, 0, 0, 1} or {1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0} μ₁₀₉ {0, 0, 1, 0,1, 0, 0, 1, 1, 0, 0, 1} or {1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0} μ₁₁₀ {0,1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1} or {1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0}μ₁₁₁ {0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1} or {1, 0, 1, 0, 0, 1, 1, 1, 0,0, 1, 0} μ₁₁₂ {1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1} or {0, 1, 0, 0, 1, 0,1, 1, 0, 0, 1, 0} μ₁₁₃ {1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1} or {0, 1, 1,1, 0, 0, 1, 1, 1, 1, 0, 0} μ₁₁₄ {1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1} or{0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0} μ₁₁₅ {1, 1, 1, 0, 0, 0, 1, 1, 0, 0,1, 1} or {0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0} μ₁₁₆ {1, 0, 1, 0, 1, 1, 0,0, 1, 0, 1, 1} or {0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0} μ₁₁₇ {1, 0, 1, 1,0, 0, 1, 0, 0, 1, 1, 1} or {0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0} μ₁₁₈ {1,0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1} or {0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0}μ₁₁₉ {1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0} or {0, 0, 1, 0, 0, 1, 0, 1, 1,1, 1, 1} μ₁₂₀ {0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0} or {1, 1, 0, 0, 1, 0,0, 1, 1, 1, 1, 1} μ₁₂₁ {0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0} or {1, 1, 1,1, 0, 1, 1, 0, 1, 1, 1, 1} μ₁₂₂ {1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0} or{0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1} μ₁₂₃ {1, 0, 0, 1, 1, 1, 1, 1, 0, 0,0, 0} or {0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1} μ₁₂₄ {0, 1, 1, 1, 0, 0, 1,0, 1, 0, 0, 0} or {1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1} μ₁₂₅ {0, 0, 0, 1,1, 0, 1, 0, 1, 0, 0, 0} or {1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1} μ₁₂₆ {0,0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0} or {1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1}μ₁₂₇ {1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0} or {0, 0, 1, 0, 1, 0, 0, 0, 0,1, 1, 1} μ₁₂₈ {1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0} or {0, 1, 1, 0, 1, 1,1, 1, 1, 0, 1, 1} μ₁₂₉ {1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0} or {0, 1, 1,0, 1, 1, 0, 1, 1, 0, 1, 1} μ₁₃₀ {0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0} or{1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1} μ₁₃₁ {1, 0, 1, 1, 1, 0, 1, 0, 0, 1,0, 0} or {0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1} μ₁₃₂ {1, 1, 0, 0, 0, 1, 0,1, 0, 1, 0, 0} or {0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1} μ₁₃₃ {0, 0, 0, 1,1, 1, 0, 0, 1, 1, 0, 0} or {1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1} μ₁₃₄ {1,0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0} or {0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1}μ₁₃₅ {0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0} or {1, 0, 0, 0, 1, 1, 1, 0, 0,0, 1, 1} μ₁₃₆ {1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0} or {0, 1, 0, 1, 1, 1,0, 0, 0, 0, 1, 1} μ₁₃₇ {1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0} or {0, 0, 1,1, 0, 1, 1, 1, 1, 1, 0, 1} μ₁₃₈ {1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0} or{0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1} μ₁₃₉ {0, 1, 0, 0, 1, 1, 1, 0, 0, 0,1, 0} or {1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1} μ₁₄₀ {0, 1, 0, 0, 1, 0, 0,1, 0, 0, 1, 0} or {1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1} μ₁₄₁ {1, 0, 0, 1,1, 1, 0, 1, 0, 0, 1, 0} or {0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1} μ₁₄₂ {1,0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0} or {0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1}μ₁₄₃ {1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0} or {0, 1, 1, 1, 0, 0, 0, 0, 1,1, 0, 1} μ₁₄₄ {0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0} or {1, 0, 1, 1, 1, 1,0, 1, 0, 1, 0, 1} μ₁₄₅ {0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0} or {1, 1, 0,0, 1, 1, 1, 0, 0, 1, 0, 1} μ₁₄₆ {0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0} or{1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1} μ₁₄₇ {1, 1, 1, 0, 1, 1, 0, 1, 1, 0,1, 0} or {0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1} μ₁₄₈ {1, 1, 0, 1, 1, 0, 1,1, 1, 0, 1, 0} or {0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1} μ₁₄₉ {1, 1, 0, 0,1, 1, 1, 1, 1, 0, 1, 0} or {0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1} μ₁₅₀ {0,0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0} or {1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1}μ₁₅₁ {1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0} or {0, 0, 1, 1, 1, 1, 1, 0, 1,0, 0, 1} μ₁₅₂ {0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0} or {1, 0, 0, 0, 1, 1,1, 0, 1, 0, 0, 1} μ₁₅₃ {0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0} or {1, 0, 0,1, 0, 1, 0, 0, 1, 0, 0, 1} μ₁₅₄ {1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0} or{0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1} μ₁₅₅ {0, 1, 1, 0, 0, 0, 0, 0, 1, 1,1, 0} or {1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1} μ₁₅₆ {0, 0, 1, 1, 1, 0, 0,0, 1, 1, 1, 0} or {1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1} μ₁₅₇ {0, 0, 0, 1,0, 1, 0, 0, 1, 1, 1, 0} or {1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1} μ₁₅₈ {0,1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0} or {1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1}μ₁₅₉ {1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0} or {0, 1, 1, 0, 1, 1, 0, 1, 0,0, 0, 1} μ₁₆₀ {0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0} or {1, 0, 1, 1, 1, 0,0, 1, 0, 0, 0, 1} μ₁₆₁ {1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0} or {0, 0, 0,1, 0, 1, 1, 0, 0, 0, 0, 1} μ₁₆₂ {1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0} or{0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1}

In some embodiments, any sequence from Table 3-2 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-1).

In some embodiments, in the above Table 3-2, L (where L is an integerand 1≤L≤30) CG sequences each with an index μ_(s) (where s is an integerand 0≤s≤162) may be included in the predetermined sequence table forDMRS with length 12. For each index μ_(s), either one of the twosequences can be included in the predetermined sequence table for DMRSwith length 12. For example, μ_(s)∈[0, 29]. In some embodiments, ifthere are more than one sequences from the above Table 3-2 that areincluded in the predetermined sequence table for DMRS with length 12,the indices μ_(s1) and/s2 of any two of the sequences which are includedin the predetermined sequence table may be different, where s1 is aninteger and 0≤s1≤162, s2 is an integer and 0≤s2≤162, and s1≠s2.

In some embodiments, in the above Table 3-2, 30 CG sequences each withan index μ_(s) (where s is an integer and 0≤s≤162) may be included inthe predetermined sequence table for DMRS with length 12. For example,μ_(s)∈[0, 29]. For each index μ_(s), either one of the two sequences canbe included in the predetermined sequence table for DMRS with length 12.In addition, the indices μ_(s1) and μ_(s2) of any two of the sequenceswhich are included in the predetermined sequence table may be different,where s1 is an integer and 0≤s1≤162, s2 is an integer and 0≤s2≤162, ands1≠s2. That is, all the values of μ_(s) for the 30 sequences that areincluded in the predetermined sequence table may be included in a set{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

In some embodiments, in the above Table 3-2, L (where L is an integerand 1≤L≤4) CG sequences each with an index μ_(s) (where s∈{20, 21, 24,92}) may be included in the predetermined sequence table for DMRS withlength 12. For example, μ_(s)∈[0, 29]. In some embodiments, for twosequences with a same index μ_(s) in the above Table 3-2, either one ofthe two sequences can be included in the predetermined sequence tablefor DMRS with length 12. In some embodiments, if there are more than onesequences each with an index μ_(s) (s∈{20, 21, 24, 92}) from the aboveTable 3-2 that are included in the predetermined sequence table for DMRSwith length 12, the indices μ_(s1) and μ_(s2) of any two of thesequences which are included in the predetermined sequence table may bedifferent, where s1∈{20, 21, 24, 92} and s2∈{20, 21, 24, 92}.

In some embodiments, in the above Table 3-2, L (where L is an integerand 1≤L≤4) CG sequences each with an index μ_(s) (where s∈{40, 56, 123,141}) may be included in the predetermined sequence table for DMRS withlength 12. For example, μ_(s)∈[0, 29]. In some embodiments, for twosequences with a same index μ_(s) in the above Table 3-2, either one ofthe two sequences can be included in the predetermined sequence tablefor DMRS with length 12. In some embodiments, if there are more than onesequences each with an index μ_(s) (s∈{40, 56, 123, 141}) from the aboveTable 3-2 that are included in the predetermined sequence table for DMRSwith length 12, the indices μ_(s1) and μ_(s2) of any two of thesequences which are included in the predetermined sequence table may bedifferent, where s1∈{40, 56, 123, 141} and s2∈{40, 56, 123, 141}.

In some embodiments, if the predetermined sequence length is 18, thedetermined plurality of CG sequences may include one or more of CGsequences in Table 4:

TABLE 4 Length-18 CG sequences for π/2-BPSK CG Sequence Index {b(0), . .. , b(17)} μ₀ {0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0} or{1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1} μ₁ {0, 1, 1, 0,1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0} or {1, 0, 0, 1, 0, 1, 1, 1, 0,1, 1, 1, 0, 0, 0, 0, 1, 1} μ₂ {0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1,0, 0, 1, 0} or {1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1} μ₃{1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0} or {0, 0, 0, 1,1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1} μ₄ {1, 1, 1, 1, 1, 1, 1, 0, 0,0, 1, 0, 1, 0, 0, 1, 0, 0} or {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1,1, 0, 1, 1} μ₅ {1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0} or{0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1} μ₆ {1, 0, 1, 1,0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0} or {0, 1, 0, 0, 1, 0, 1, 1, 1,0, 1, 0, 0, 1, 0, 1, 0, 1} μ₇ {1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0,0, 1, 0, 0} or {0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1} μ₈{0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0} or {1, 0, 1, 1,0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1} μ₉ {1, 1, 0, 1, 1, 0, 1, 1, 1,0, 1, 1, 1, 1, 1, 0, 1, 0} or {0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0,0, 1, 0, 1} μ₁₀ {1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0}or {0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1} μ₁₁ {0, 0, 0,1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0} or {1, 1, 1, 0, 0, 1, 0, 0,0, 1, 1, 0, 1, 1, 0, 0, 1, 1} μ₁₂ {0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1,0, 1, 0, 1, 1, 0} or {1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0,1} μ₁₃ {0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0} or {1, 1,1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1} μ₁₄ {1, 1, 0, 0, 1, 1,1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0} or {0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1,0, 1, 1, 1, 0, 0, 1} μ₁₅ {0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1,1, 0, 0} or {1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1} μ₁₆{0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0} or {1, 0, 1, 1,0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1} μ₁₇ {1, 1, 1, 1, 1, 0, 0, 1,0, 1, 1, 1, 0, 1, 0, 1, 0, 0} or {0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1,0, 1, 0, 1, 1} μ₁₈ {1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1,0} or {0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1} μ₁₉ {1, 1,1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0} or {0, 0, 0, 1, 0, 1, 0,1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1} μ₂₀ {0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0,0, 1, 1, 0, 0, 0, 0} or {1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1,1, 1} μ₂₁ {1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0} or {0,0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1} μ₂₂ {1, 0, 0, 1, 0,0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0} or {0, 1, 1, 0, 1, 1, 0, 1, 0, 0,1, 1, 1, 0, 0, 1, 0, 1} μ₂₃ {1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0,1, 0, 0, 0} or {0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1}μ₂₄ {0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0} or {1, 0, 1,0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1} μ₂₅ {0, 1, 1, 1, 1, 1, 0,0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0} or {1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0,1, 1, 0, 1, 0, 1} μ₂₆ {0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1,1, 0} or {1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1} μ₂₇ {1,1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0} or {0, 0, 0, 1, 1, 0,1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1} μ₂₈ {0, 0, 0, 0, 1, 1, 1, 1, 0, 1,1, 0, 1, 1, 1, 0, 1, 0} or {1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0,1, 0, 1} μ₂₉ {1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0} or{0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1}FIG. 4D shows the performance of the CG sequences in Table 4. Forexample, the cross-correlation performance of the CG sequences in Table4 is shown in a cumulative distribution function (CDF) curve 441 in FIG.4D, in which the horizontal axis may represent autocorrelation valuesand the vertical axis may represent cumulative distributionprobabilities. The PAPR performance (including the mean PAPR, themaximum PAPR and the minimum PAPR) of the CG sequences in Table 4 isshown in Table 442 in FIG. 4D. The cross-correlation performance(including the mean cross-correlation and the maximum cross-correlation)of the CG sequences in Table 4 is shown in Table 443 in FIG. 4D.

In some embodiments, any sequence from Table 4 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-1).

In some embodiments, in the above Table 4, all of the 30 CG sequencesmay be included in the predetermined sequence table for DMRS with length18, and μ_(s) may represent an index of a sequence within thepredetermined sequence table, where s is an integer and 0≤s≤29. Forexample, μ_(s)∈[0, 29]. For each index μ_(s), either one of the twosequences can be included in the predetermined sequence table for DMRSwith length 18. The indices μ_(s1) and μ_(s2) of any two of thesequences which are included in the predetermined sequence table may bedifferent, where s1 is an integer and 0≤s1≤29, s2 is an integer and0≤s2≤29, and s1≠s2. That is, all the values of μ_(s) may be included ina set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

Alternatively, in some embodiments, if the predetermined sequence lengthis 18, the determined plurality of CG sequences may include one or moreof CG sequences in Table 5-1:

TABLE 5-1 Length-18 CG sequences for π/2-BPSK CG Sequence Index {b(0), .. . , b(17)} μ₀ {1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0}or {0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1} μ₁ {0, 1, 0,0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0} or {1, 0, 1, 1, 0, 1, 1, 1,1, 1, 0, 0, 1, 0, 1, 0, 1, 1} μ₂ {1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1,1, 1, 0, 0, 0} or {0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1}μ₃ {1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0} or {0, 1, 1,0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1} μ₄ {1, 1, 0, 0, 1, 1, 1, 0,0, 1, 1, 1, 0, 0, 1, 0, 0, 0} or {0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1,1, 0, 1, 1, 1} μ₅ {0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0}or {1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1} μ₆ {0, 1, 1,1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0} or {1, 0, 0, 0, 1, 1, 0, 0,1, 0, 0, 0, 1, 0, 1, 1, 0, 1} μ₇ {0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1,0, 1, 1, 0, 0} or {1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1}μ₈ {0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0} or {1, 0, 0,1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1} μ₉ {0, 1, 1, 0, 0, 1, 0, 0,0, 1, 0, 0, 1, 1, 0, 0, 1, 0} or {1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0,0, 1, 1, 0, 1} μ₁₀ {1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1,0} or {0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1} μ₁₁ {1, 0,0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0} or {0, 1, 1, 1, 0, 1, 1,1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1} μ₁₂ {1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1,0, 1, 1, 0, 1, 0, 0} or {0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0,1, 1} μ₁₃ {0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0} or {1,1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1} μ₁₄ {0, 0, 0, 0, 0,1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0} or {1, 1, 1, 1, 1, 0, 0, 1, 0, 1,1, 0, 1, 1, 0, 1, 0, 1} μ₁₅ {0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0,1, 1, 1, 0} or {1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1}μ₁₆ {1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0} or {0, 1, 0,0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1} μ₁₇ {0, 0, 1, 1, 0, 0, 1,0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0} or {1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1,1, 0, 0, 1, 1, 1} μ₁₈ {0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1,1, 0} or {1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1} μ₁₉ {0,1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0} or {1, 0, 0, 0, 1, 0,1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1} μ₂₀ {0, 0, 0, 0, 0, 1, 0, 1, 0, 1,0, 0, 1, 0, 1, 1, 0, 0} or {1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0,0, 1, 1} μ₂₁ {1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0} or{0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1} μ₂₂ {0, 0, 1, 0,1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0} or {1, 1, 0, 1, 0, 0, 1, 1, 0,0, 1, 0, 1, 1, 1, 0, 0, 1} μ₂₃ {0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1,1, 1, 1, 1, 0} or {1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1}μ₂₄ {1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0} or {0, 1, 0,1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1} μ₂₅ {1, 0, 0, 1, 1, 1, 1,1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0} or {0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1,1, 0, 0, 1, 1, 1} μ₂₆ {0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1,0, 0} or {1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1} μ₂₇ {1,1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0} or {0, 0, 1, 0, 0, 1,0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1} μ₂₈ {0, 1, 0, 1, 0, 1, 1, 0, 1, 0,1, 0, 1, 1, 0, 0, 1, 0} or {1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1,1, 0, 1} μ₂₉ {1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0} or{0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1}FIG. 4E shows the performance of the CG sequences in Table 5-1. Forexample, the cross-correlation performance of the CG sequences in Table5-1 is shown in a cumulative distribution function (CDF) curve 451 inFIG. 4E, in which the horizontal axis may represent autocorrelationvalues and the vertical axis may represent cumulative distributionprobabilities. The PAPR performance (including the mean PAPR, themaximum PAPR and the minimum PAPR) of the CG sequences in Table 5-1 isshown in Table 452 in FIG. 4E. The cross-correlation performance(including the mean cross-correlation and the maximum cross-correlation)of the CG sequences in Table 5-1 is shown in Table 453 in FIG. 4E.

In some embodiments, any sequence from Table 5-1 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-1).

In some embodiments, in either one of the above Table 4 and Table 5-1, L(where L is an integer and 1≤L<30) CG sequences each with an index μ_(s)(where s is an integer and 0≤s≤29) may be included in the predeterminedsequence table for DMRS with length 18. For example, μ_(s)∈[0, 29]. Insome embodiments, in either one of the above Table 4 and Table 5-1, foreach index μ_(s), either one of the two sequences can be included in thepredetermined sequence table for DMRS with length 18. In someembodiments, if there are more than one sequences from either one of theabove Table 4 and Table 5-1 that are included in the predeterminedsequence table for DMRS with length 18, the indices μ_(s1) and μ_(s2) ofany two of the sequences which are included in the predeterminedsequence table may be different, where s1 is an integer and 0≤s1≤29, s2is an integer and 0≤s2≤29, and s1≠s2.

In some embodiments, in the above Table 5-1, all of the 30 CG sequencesmay be included in the predetermined sequence table for DMRS with length18, and μ_(s) may represent an index of a sequence within thepredetermined sequence table, where s is an integer and 0≤s≤29. Forexample, μ_(s)∈[0, 29]. For each index μ_(s), either one of the twosequences can be included in the predetermined sequence table for DMRSwith length 18. The indices μ_(s1) and μ_(s2) of any two of thesequences which are included in the predetermined sequence table may bedifferent, where s1 is an integer and 0≤s1≤29, s2 is an integer and0≤s2≤29, and s1≠s2. That is, all the values of μ_(s) may be included ina set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

Alternatively, in some embodiments, if the predetermined sequence lengthis 18, the predetermined sequence table for DMRS with length 18 mayinclude L (where L is an integer and 1≤L≤30) CG sequences in Table 5-2:

TABLE 5-2 Length-18 CG sequences for π/2-BPSK CG Sequence Index {b(0), .. . , b(11)} μ₀ {0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0}or {1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1} μ₁ {1, 1, 0,1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0} or {0, 0, 1, 0, 1, 0, 0, 1,0, 0, 0, 1, 1, 1, 1, 1, 1, 1} μ₂ {1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0,0, 0, 0, 0, 0} or {0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1}μ₃ {0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0} or {1, 1, 1,0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1} μ₄ {0, 1, 1, 0, 0, 1, 1, 1,1, 1, 0, 0, 1, 1, 0, 0, 0, 0} or {1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0,0, 1, 1, 1, 1} μ₅ {0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0}or {1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1} μ₆ {0, 0, 1,0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0} or {1, 1, 0, 1, 0, 1, 1, 0,1, 1, 0, 1, 1, 1, 0, 1, 1, 1} μ₇ {1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0,0, 1, 0, 0, 0} or {0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1}μ₈ {1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0} or {0, 0, 0,1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1} μ₉ {1, 0, 0, 1, 1, 1, 1, 1,0, 0, 0, 0, 0, 1, 1, 0, 0, 0} or {0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1,0, 0, 1, 1, 1} μ₁₀ {0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0,0} or {1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1} μ₁₁ {1, 0,0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0} or {0, 1, 1, 1, 0, 1, 0,1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1} μ₁₂ {1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0,0, 1, 1, 1, 0, 0, 0} or {0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1,1, 1} μ₁₃ {1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0} or {0,0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1} μ₁₄ {1, 1, 0, 0, 0,1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0} or {0, 0, 1, 1, 1, 0, 0, 1, 1, 0,0, 0, 1, 1, 1, 0, 1, 1} μ₁₅ {1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0,0, 1, 0, 0} or {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1}μ₁₆ {0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0} or {1, 0, 0,0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1} μ₁₇ {0, 1, 0, 0, 1, 1, 1,1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0} or {1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0,0, 1, 1, 0, 1, 1} μ₁₈ {1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1,0, 0} or {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1} μ₁₉ {0,0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0} or {1, 1, 1, 0, 1, 1,0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1} μ₂₀ {1, 1, 1, 1, 1, 0, 0, 0, 1, 0,0, 1, 0, 1, 0, 1, 0, 0} or {0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1,0, 1, 1} μ₂₁ {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0} or{1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1} μ₂₂ {1, 1, 1, 1,1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0} or {0, 0, 0, 0, 0, 1, 1, 0, 1,0, 0, 0, 1, 0, 1, 0, 1, 1} μ₂₃ {1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1,1, 0, 1, 0, 0} or {0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1}μ₂₄ {0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0} or {1, 0, 0,1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1} μ₂₅ {0, 0, 0, 1, 1, 0, 1,1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0} or {1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0,1, 1, 0, 0, 1, 1} μ₂₆ {0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1,0, 0} or {1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1} μ₂₇ {0,0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0} or {1, 1, 1, 1, 1, 0,1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1} μ₂₈ {1, 0, 1, 0, 0, 1, 1, 1, 0, 0,0, 1, 1, 0, 1, 1, 0, 0} or {0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0,0, 1, 1} μ₂₉ {0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0} or{1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1} μ₃₀ {0, 1, 0, 1,0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0} or {1, 0, 1, 0, 1, 1, 1, 0, 1,1, 0, 1, 1, 0, 0, 0, 1, 1} μ₃₁ {1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0,1, 1, 1, 0, 0} or {0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1}μ₃₂ {1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0} or {0, 1, 1,0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1} μ₃₃ {0, 1, 1, 0, 1, 0, 0,0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0} or {1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1,0, 0, 0, 0, 1, 1} μ₃₄ {1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1,0, 0} or {0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1} μ₃₅ {1,0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0} or {0, 1, 0, 1, 1, 0,0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1} μ₃₆ {1, 0, 0, 0, 1, 0, 0, 0, 1, 1,0, 0, 1, 0, 0, 0, 1, 0} or {0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1,1, 0, 1} μ₃₇ {0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0} or{1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1} μ₃₈ {1, 1, 0, 1,0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0} or {0, 0, 1, 0, 1, 0, 1, 0, 0,1, 1, 1, 1, 0, 1, 1, 0, 1} μ₃₉ {1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0,1, 0, 0, 1, 0} or {0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1}μ₄₀ {0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0} or {1, 0, 0,0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1} μ₄₁ {0, 1, 1, 0, 0, 1, 0,0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0} or {1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1,0, 0, 1, 1, 0, 1} μ₄₂ {0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0,1, 0} or {1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1} μ₄₃ {0,1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0} or {1, 0, 1, 1, 1, 0,1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1} μ₄₄ {0, 1, 1, 1, 1, 1, 0, 0, 1, 0,0, 1, 0, 0, 1, 0, 1, 0} or {1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0,1, 0, 1} μ₄₅ {0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0} or{1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1} μ₄₆ {1, 0, 1, 1,0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0} or {0, 1, 0, 0, 1, 0, 1, 1, 1,0, 1, 0, 0, 1, 0, 1, 0, 1} μ₄₇ {1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0,1, 1, 0, 1, 0} or {0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1}μ₄₈ {0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0} or {1, 1, 1,1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1} μ₄₉ {1, 1, 0, 1, 1, 0, 1,1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0} or {0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0,0, 0, 0, 1, 0, 1} μ₅₀ {1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1,1, 0} or {0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1} μ₅₁ {1,1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0} or {0, 0, 1, 1, 0, 0,0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1} μ₅₂ {0, 0, 1, 0, 1, 1, 0, 0, 1, 1,0, 1, 0, 0, 0, 1, 1, 0} or {1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1,0, 0, 1} μ₅₃ {1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0} or{0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1} μ₅₄ {1, 1, 1, 0,0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0} or {0, 0, 0, 1, 1, 1, 1, 1, 0,0, 1, 0, 1, 0, 1, 0, 0, 1} μ₅₅ {0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0,1, 0, 1, 1, 0} or {1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1}μ₅₆ {1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0} or {0, 0, 1,0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1} μ₅₇ {1, 1, 0, 1, 1, 0, 1,1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0} or {0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1,0, 0, 1, 0, 0, 1} μ₅₈ {0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1,1, 0} or {1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1} μ₅₉ {0,0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0} or {1, 1, 0, 1, 0, 1,0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1} μ₆₀ {0, 1, 0, 0, 1, 1, 1, 0, 0, 0,1, 0, 0, 0, 1, 1, 1, 0} or {1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0,0, 0, 1} μ₆₁ {1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0} or{0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1} μ₆₂ {1, 1, 1, 0,0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0} or {0, 0, 0, 1, 1, 1, 0, 0, 1,0, 0, 1, 1, 1, 0, 0, 0, 1} μ₆₃ {0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0,0, 1, 1, 1, 0} or {1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1}μ₆₄ {0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0} or {1, 0, 0,0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1} μ₆₅ {1, 1, 1, 0, 1, 1, 1,0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0} or {0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1,1, 0, 0, 0, 0, 1} μ₆₆ {0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1,1, 0} or {1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1} μ₆₇ {1,1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0} or {0, 0, 0, 0, 0, 1,1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1} μ₆₈ {0, 0, 0, 1, 1, 0, 0, 1, 1, 0,1, 1, 1, 1, 0, 0, 0, 0} or {1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1,1, 1, 1} μ₆₉ {1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0} or{0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1} μ₇₀ {0, 1, 1, 0,0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0} or {1, 0, 0, 1, 1, 1, 1, 0, 0,1, 1, 0, 0, 1, 0, 1, 1, 1} μ₇₁ {0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0,1, 1, 0, 0, 0} or {1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1}μ₇₂ {1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0} or {0, 1, 0,0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1} μ₇₃ {0, 1, 1, 1, 1, 1, 1,1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0} or {1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0,0, 1, 1, 0, 1, 1} μ₇₄ {1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1,0, 0} or {0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1} μ₇₅ {1,0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0} or {0, 1, 1, 1, 1, 1,1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1} μ₇₆ {0, 0, 1, 1, 1, 0, 1, 1, 0, 1,0, 0, 1, 0, 1, 1, 0, 0} or {1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0,0, 1, 1} μ₇₇ {1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0} or{0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1} μ₇₈ {0, 0, 0, 0,1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0} or {1, 1, 1, 1, 0, 0, 1, 0, 0,0, 1, 1, 0, 0, 0, 0, 1, 1} μ₇₉ {1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0,0, 0, 0, 1, 0} or {0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1}μ₈₀ {0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0} or {1, 0, 1,1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1} μ₈₁ {0, 1, 1, 0, 0, 0, 0,0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0} or {1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1,0, 0, 1, 1, 0, 1} μ₈₂ {1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0,1, 0} or {0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1} μ₈₃ {1,0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0} or {0, 1, 1, 0, 1, 0,0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1} μ₈₄ {0, 1, 0, 1, 1, 0, 0, 1, 0, 0,1, 1, 0, 0, 1, 0, 1, 0} or {1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0,1, 0, 1} μ₈₅ {0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0} or{1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1} μ₈₆ {0, 0, 1, 0,1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0} or {1, 1, 0, 1, 0, 0, 1, 1, 1,1, 0, 0, 1, 0, 0, 1, 0, 1} μ₈₇ {0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0,0, 0, 1, 1, 0} or {1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1}μ₈₈ {1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0} or {0, 0, 0,1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1} μ₈₉ {0, 1, 0, 1, 0, 0, 1,1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0} or {1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1,0, 1, 1, 0, 0, 1} μ₉₀ {0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1,1, 0} or {1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1} μ₉₁ {0,0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0} or {1, 1, 0, 1, 1, 0,0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1} μ₉₂ {0, 0, 0, 1, 1, 1, 0, 0, 0, 0,0, 1, 1, 1, 0, 1, 1, 0} or {1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1,0, 0, 1} μ₉₃ {0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0} or{1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1} μ₉₄ {1, 1, 0, 0,0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0} or {0, 0, 1, 1, 1, 0, 1, 1, 0,0, 0, 1, 0, 0, 0, 0, 0, 1}

In some embodiments, any sequence from Table 5-2 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-1).

In some embodiments, in the above Table 5-2, L (where L is an integerand 1≤L≤30) CG sequences may be included in the predetermined sequencetable for DMRS with length 18, and μ_(s) may represent an index of asequence which is included in the predetermined sequence table, where sis an integer and 0≤s≤94. In some embodiments, in the above Table 5-2,for each index μ_(s), either one of the two sequences can be included inthe predetermined sequence table for DMRS with length 18. For example,μ_(s)∈[0, 29]. In some embodiments, if there are more than one sequencesthat are included in the predetermined sequence table for DMRS withlength 18, the indices μ_(s1) and μ_(s2) of any two of the sequenceswhich are included in the predetermined sequence table may be different,where s1 is an integer and 0≤s1≤94, s2 is an integer and 0≤s2≤94, ands1≠s2.

In some embodiments, in the above Table 5-2, 30 CG sequences each withan index μ_(s) (where s is an integer and 0≤s≤94) may be included in thepredetermined sequence table for DMRS with length 18. For example,μ_(s)∈[0, 29]. For each index μ_(s), either one of the two sequences canbe included in the predetermined sequence table for DMRS with length 18.The indices μ_(s1) and μ_(s2) of any two of the sequences which areincluded in the predetermined sequence table may be different, where s1is an integer and 0≤s1≤94, s2 is an integer and 0≤s2≤94, and s1≠s2. Thatis, all the values of μ_(s) for the 30 sequences that are included inthe predetermined sequence table may be included in a set {0, 1, 2, 3,4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,23, 24, 25, 26, 27, 28, 29}.

In some embodiments, in the above Table 5-2, L (where L is an integerand 1≤L≤7) CG sequences each with an index μ_(s) (where s∈{1, 16, 18,20, 34, 37, 54}) may be included in the predetermined sequence table forDMRS with length 18. For example, μ_(s) E [0, 29]. For two sequenceswith a same index μ_(s) in the above Table 5-2, either one of the twosequences can be included in the predetermined sequence table for DMRSwith length 18. In some embodiments, if there are more than onesequences each with an index μ_(s) (where s∈{1, 16, 18, 20, 34, 37, 54})from the above Table 5-2 that are included in the predetermined sequencetable for DMRS with length 18, the indices μ_(s1) and μ_(s2) of any twoof the sequences which are included in the predetermined sequence tablemay be different, where s1∈{1, 16, 18, 20, 34, 37, 54} and s2∈{1, 16,18, 20, 34, 37, 54}.

In some embodiments, if the predetermined sequence length is 24, thedetermined plurality of CG sequences may include one or more of CGsequences in Table 6:

TABLE 6 Length-24 CG sequences for π/2-BPSK CG Sequence Index {b(0), . .. , b(23)} μ₀ {1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0,0, 0, 1, 0, 0} μ₁ {1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0,0, 1, 0, 0, 1, 0} μ₂ {1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1,1, 1, 1, 0, 1, 1, 0} μ₃ {0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1,0, 1, 0, 1, 1, 1, 0, 0} μ₄ {0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0,1, 1, 1, 0, 1, 1, 0, 0, 0} μ₅ {1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0,1, 1, 1, 0, 1, 0, 0, 1, 1, 0} μ₆ {0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0,0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0} μ₇ {1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0,1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0} μ₈ {0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1,1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0} μ₉ {1, 1, 1, 1, 1, 0, 1, 1, 0, 0,0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0} μ₁₀ {0, 0, 1, 1, 0, 1, 0, 0,0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0} μ₁₁ {0, 0, 1, 0, 0, 1,0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0} μ₁₂ {1, 1, 0, 1,0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0} μ₁₃ {0, 0,1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0} μ₁₄{1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0}μ₁₅ {1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0,0, 0} μ₁₆ {0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0,1, 1, 0, 0} μ₁₇ {1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0,1, 1, 0, 1, 0, 0} μ₁₈ {1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1,1, 1, 1, 0, 0, 1, 0, 0} μ₁₉ {0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1,0, 1, 0, 1, 0, 0, 1, 1, 1, 0} μ₂₀ {0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1,1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0} μ₂₁ {0, 1, 1, 1, 1, 1, 0, 0, 1, 0,0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0} μ₂₂ {0, 0, 1, 1, 0, 1, 1, 0,1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0} μ₂₃ {0, 1, 1, 1, 1, 0,1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0} μ₂₄ {0, 0, 1, 1,1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0} μ₂₅ {0, 1,1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0} μ₂₆{1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0}μ₂₇ {1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1,0, 0} μ₂₈ {1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0,0, 1, 1, 0} μ₂₉ {1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0,1, 0, 1, 1, 0, 0}FIG. 4F shows the performance of the CG sequences in Table 6. Forexample, the cross-correlation performance of the CG sequences in Table6 is shown in a cumulative distribution function (CDF) curve 461 in FIG.4F, in which the horizontal axis may represent autocorrelation valuesand the vertical axis may represent cumulative distributionprobabilities. The PAPR performance (including the mean PAPR, themaximum PAPR and the minimum PAPR) of the CG sequences in Table 6 isshown in Table 462 in FIG. 4F. The cross-correlation performance(including the mean cross-correlation and the maximum cross-correlation)of the CG sequences in Table 6 is shown in Table 463 in FIG. 4F.

In some embodiments, in the above Table 6, all of the 30 CG sequencesmay be included in the predetermined sequence table for DMRS with length24, and μ_(s) may represent an index of a sequence within thepredetermined sequence table, where s is an integer and 0≤s≤29. In theabove Table 6, for example, μ_(s)∈[0, 29]. For each index μ_(s), eitherone of the two sequences can be included in the predetermined sequencetable for DMRS with length 24. In addition, the indices μ_(s1) andμ_(s2) of any two of the sequences which are included in thepredetermined sequence table may be different, where s1 is an integerand 0≤s1≤29, s2 is an integer and 0≤s2≤29, and s1≠s2. That is, all thevalues of μ_(s) may be included in a set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27,28, 29}.

Alternatively, in some embodiments, if the predetermined sequence lengthis 24, the determined plurality of CG sequences may include one or moreof CG sequences in Table 7-1:

TABLE 7-1 Length-24 CG sequences for π/2-BPSK CG Sequence Index {b(0), .. . , b(23)} μ₀ {0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0,1, 0, 1, 0, 0, 0} μ₁ {0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1,0, 0, 1, 0, 0, 1, 0} μ₂ {1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1,0, 0, 1, 0, 0, 0, 0, 0} μ₃ {1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1,1, 0, 0, 0, 1, 0, 0, 1, 0} μ₄ {1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0,1, 1, 0, 1, 0, 1, 1, 0, 0, 0} μ₅ {0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0,0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0} μ₆ {0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1,0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0} μ₇ {1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0,0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0} μ₈ {0, 1, 0, 1, 0, 1, 0, 0, 1, 0,0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0} μ₉ {1, 0, 0, 1, 1, 0, 1, 0, 1,1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0} μ₁₀ {0, 1, 0, 0, 1, 1, 1,0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0} μ₁₁ {0, 1, 0, 0, 0,0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0} μ₁₂ {1, 0, 0,0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0} μ₁₃ {0,0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0} μ₁₄{0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0}μ₁₅ {1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1,1, 0} μ₁₆ {1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1,1, 0, 0, 0} μ₁₇ {1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0,0, 0, 1, 0, 0, 0} μ₁₈ {1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0,0, 0, 1, 1, 1, 1, 1, 0} μ₁₉ {0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1,1, 1, 0, 0, 0, 1, 1, 0, 0, 0} μ₂₀ {0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0,0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0} μ₂₁ {1, 0, 1, 1, 1, 0, 0, 0, 1, 1,1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0} μ₂₂ {1, 0, 0, 0, 1, 0, 0, 1,1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0} μ₂₃ {1, 0, 1, 0, 1, 1,0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0} μ₂₄ {0, 1, 1, 1,1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0} μ₂₅ {0, 1,0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0} μ₂₆{0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0}μ₂₇ {0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0,0, 0} μ₂₈ {0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1,0, 1, 1, 0} μ₂₉ {1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0,1, 1, 1, 1, 0, 0}

In some embodiments, in either one of the above Table 6 and Table 7-1, L(where L is an integer and 1≤L<30) CG sequences may be included in thepredetermined sequence table for DMRS with length 24, and μ_(s) mayrepresent an index of a sequence within the predetermined sequencetable, where s is an integer and 0≤s≤29. In either one of the aboveTable 6 and Table 7-1, μ_(s)∈[0, 29]. In some embodiments, in either oneof the above Table 6 and Table 7-1, for each index μ_(s), either one ofthe two sequences can be included in the predetermined sequence tablefor DMRS with length 24. In some embodiments, if there are more than onesequences from either one of the above Table 6 and Table 7-1 that areincluded in the predetermined sequence table for DMRS with length 24,the indices μ_(s1) and μ_(s2) of any two of the sequences which areincluded in the predetermined sequence table may be different, where s1is an integer and 0≤s1≤29, s2 is an integer and 0≤s2≤29, and s1≠s2.

In some embodiments, in the above Table 7-1, all of the 30 CG sequencesmay be included in the predetermined sequence table for DMRS with length24, and μ_(s) may represent an index of a sequence within thepredetermined sequence table, where s is an integer and 0≤s≤29. In theabove Table 7-1, for example, μ_(s)∈[0, 29]. For each index μ_(s),either one of the two sequences can be included in the predeterminedsequence table for DMRS with length 24. The indices μ_(s1) and μ_(s2) ofany two of the sequences which are included in the predeterminedsequence table may be different, where s1 is an integer and 0≤s1≤29, s2is an integer and 0≤s2≤29, and s1≠s2. That is, all the values of μ_(s)may be included in a set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29}.

Alternatively, in some embodiments, if the predetermined sequence lengthis 24, the determined plurality of CG sequences may include L (where Lis an integer and 1≤L≤30) CG sequences in Table 7-2:

TABLE 7-2 Length-24 CG sequences for π/2-BPSK CG Sequence Index {b(0), .. . , b(11)} μ₀ {0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1,0, 0, 0, 0, 0, 0} or {1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0,0, 1, 1, 1, 1, 1, 1} μ₁ {1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1,0, 0, 1, 0, 0, 0, 0, 0} or {0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0,0, 1, 1, 0, 1, 1, 1, 1, 1} μ₂ {0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0,0, 1, 0, 1, 1, 0, 0, 0, 0, 0} or {1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1,1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1} μ₃ {1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0,1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0} or {0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1,1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1} μ₄ {0, 0, 1, 1, 1, 0, 0, 1, 0, 1,0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0} or {1, 1, 0, 0, 0, 1, 1, 0, 1,0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1} μ₅ {1, 1, 1, 1, 1, 0, 1, 1,0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0} or {0, 0, 0, 0, 0, 1, 0,0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1} μ₆ {1, 1, 0, 0, 0, 1,1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0} or {0, 0, 1, 1, 1,0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1} μ₇ {0, 1, 1, 1,0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0} or {1, 0, 0,0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1} μ₈ {1, 1,0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0} or {0,0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1} μ₉{1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0}or {0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1,1} μ₁₀ {0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1,0, 0, 0} or {1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1,0, 1, 1, 1} μ₁₁ {1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0,1, 0, 1, 0, 0, 0} or {0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0,1, 0, 1, 0, 1, 1, 1} μ₁₂ {0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1,0, 1, 0, 1, 0, 1, 0, 0, 0} or {1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1,0, 1, 0, 1, 0, 1, 0, 1, 1, 1} μ₁₃ {0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0,0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0} or {1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1,1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1} μ₁₄ {0, 0, 1, 1, 1, 1, 0, 1, 1,1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0} or {1, 1, 0, 0, 0, 0, 1, 0,0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1} μ₁₅ {1, 1, 1, 1, 1, 0,0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0} or {0, 0, 0, 0, 0,1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1} μ₁₆ {0, 0, 0,0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0} or {1, 1,1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1} μ₁₇{1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0}or {0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1,1} μ₁₈ {1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1,0, 0, 0} or {0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0,0, 1, 1, 1} μ₁₉ {1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0,0, 0, 0, 1, 0, 0} or {0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1,1, 1, 1, 1, 0, 1, 1} μ₂₀ {0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1,0, 1, 1, 0, 0, 0, 1, 0, 0} or {1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0,0, 1, 0, 0, 1, 1, 1, 0, 1, 1} μ₂₁ {0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0,0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0} or {1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0,1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1} μ₂₂ {1, 1, 1, 1, 1, 1, 0, 0, 0,1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0} or {0, 0, 0, 0, 0, 0, 1, 1,1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1} μ₂₃ {1, 0, 1, 0, 1, 1,0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0} or {0, 1, 0, 1, 0,0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1} μ₂₄ {0, 1, 0,0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0} or {1, 0,1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1} μ₂₅{0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0}or {1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1,1} μ₂₆ {1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0,1, 0, 0} or {0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0,1, 0, 1, 1} μ₂₇ {1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0,1, 1, 0, 1, 0, 0} or {0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0,1, 0, 0, 1, 0, 1, 1} μ₂₈ {0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0,0, 0, 1, 1, 1, 0, 1, 0, 0} or {1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1,1, 1, 1, 0, 0, 0, 1, 0, 1, 1} μ₂₉ {1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1,0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0} or {0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1,0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1} μ₃₀ {0, 0, 0, 1, 1, 1, 1, 1, 0,1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0} or {1, 1, 1, 0, 0, 0, 0, 0,1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1} μ₃₁ {1, 1, 0, 0, 0, 0,0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0} or {0, 0, 1, 1, 1,1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1} μ₃₂ {1, 0, 0,1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0} or {0, 1,1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1} μ₃₃{0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0}or {1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1,1} μ₃₄ {1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1,1, 0, 0} or {0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0,0, 0, 1, 1} μ₃₅ {1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0,1, 1, 1, 1, 0, 0} or {0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1,1, 0, 0, 0, 0, 1, 1} μ₃₆ {0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0,1, 0, 1, 1, 1, 1, 1, 0, 0} or {1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1,1, 0, 1, 0, 0, 0, 0, 0, 1, 1} μ₃₇ {0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0,1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0} or {1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1,1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1} μ₃₈ {0, 1, 0, 0, 1, 0, 1, 0, 0,1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0} or {1, 0, 1, 1, 0, 1, 0, 1,1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1} μ₃₉ {1, 0, 0, 0, 1, 1,1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0} or {0, 1, 1, 1, 0,0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1} μ₄₀ {1, 0, 0,1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0} or {0, 1,1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1} μ₄₁{0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0}or {1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0,1} μ₄₂ {0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0,0, 1, 0} or {1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0,1, 1, 0, 1} μ₄₃ {0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0,1, 1, 0, 0, 1, 0} or {1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0,1, 0, 0, 1, 1, 0, 1} μ₄₄ {0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1,0, 1, 1, 1, 1, 0, 0, 1, 0} or {1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0,0, 1, 0, 0, 0, 0, 1, 1, 0, 1} μ₄₅ {1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1,0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0} or {0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1,0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1} μ₄₆ {1, 0, 1, 1, 0, 0, 0, 1, 1,0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0} or {0, 1, 0, 0, 1, 1, 1, 0,0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1} μ₄₇ {1, 0, 0, 0, 1, 0,0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0} or {0, 1, 1, 1, 0,1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1} μ₄₈ {0, 0, 1,1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0} or {1, 1,0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1} μ₄₉{1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0}or {0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0,1} μ₅₀ {1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0,1, 1, 0} or {0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1,1, 0, 0, 1} μ₅₁ {1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0,1, 0, 0, 1, 1, 0} or {0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0,1, 0, 1, 1, 0, 0, 1} μ₅₂ {0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1,1, 0, 0, 0, 1, 0, 1, 1, 0} or {1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1,0, 0, 1, 1, 1, 0, 1, 0, 0, 1} μ₅₃ {0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1,1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0} or {1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0,0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1} μ₅₄ {1, 1, 1, 0, 0, 1, 1, 1, 0,0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0} or {0, 0, 0, 1, 1, 0, 0, 0,1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1} μ₅₅ {0, 0, 1, 0, 0, 1,0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0} or {1, 1, 0, 1, 1,0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1} μ₅₆ {1, 0, 1,1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0} or {0, 1,0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1} μ₅₇{0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0}or {1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0,1} μ₅₈ {0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1,1, 1, 0} or {1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1,0, 0, 0, 1} μ₅₉ {0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1,0, 0, 1, 1, 1, 0} or {1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1,0, 1, 1, 0, 0, 0, 1} μ₆₀ {0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1,1, 0, 0, 1, 0, 1, 1, 1, 0} or {1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1,0, 0, 1, 1, 0, 1, 0, 0, 0, 1} μ₆₁ {0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1,0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0} or {1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0,0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1} μ₆₂ {1, 1, 1, 0, 0, 1, 0, 1, 1,1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0} or {0, 0, 0, 1, 1, 0, 1, 0,0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1} μ₆₃ {1, 0, 1, 0, 0, 1,1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0} or {0, 1, 0, 1, 1,0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1}

In some embodiments, any sequence from Table 7-2 may be mapped tocomplex-valued modulation symbols d(i) according the above equation(1-1).

In some embodiments, in the above Table 7-2, L (where L is an integerand 1≤L≤30) CG sequences may be included in the predetermined sequencetable for DMRS with length 24, and μ_(s) may represent an index of asequence which is included in the predetermined sequence table, where sis an integer and 0≤s≤63. In some embodiments, in the above Table 7-2,for each index μ_(s), either one of the two sequences can be included inthe predetermined sequence table for DMRS with length 24. For example,μ_(s)∈[0, 29]. In some embodiments, if there are more than one sequencesincluded in the predetermined sequence table for DMRS with length 24,the indices μ_(s1) and μ_(s2) of any two of the sequences which areincluded in the predetermined sequence table may be different, where s1is an integer and 0≤s1≤63, s2 is an integer and 0≤s2≤63, and s1≠s2.

In some embodiments, in the above Table 7-2, 30 CG sequences each withan index μ_(s) (where s is an integer and 0≤s≤63) may be included in thepredetermined sequence table for DMRS with length 24. For example,μ_(s)∈[0, 29]. For each index μ_(s), either one of the two sequences canbe included in the predetermined sequence table for DMRS with length 24.The indices μ_(s1) and μ_(s2) of any two of the sequences which areincluded in the predetermined sequence table may be different, where s1is an integer and 0≤s1≤63, s2 is an integer and 0≤s2≤63, and s1≠s2. Thatis, all the values of μ_(s) for the 30 sequences that are included inthe predetermined sequence table may be included in a set {0, 1, 2, 3,4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,23, 24, 25, 26, 27, 28, 29}.

In some embodiments, in the above Table 7-2, L (where L is an integerand 1≤L≤4) CG sequences each with an index μ_(s) (where s∈{17, 23, 24,45}) may be included in the predetermined sequence table for DMRS withlength 24. For example, μ_(s)∈[0, 29]. For two sequences with a sameindex μ_(s) in the above Table 7-2, either one of the two sequences canbe included in the predetermined sequence table for DMRS with length 24.In some embodiments, if there are more than one sequences each with anindex μ_(s) (where s∈{17, 23, 24, 45}) from the above Table 7-2 that areincluded in the predetermined sequence table for DMRS with length 24,the indices μ_(s1) and μ_(s2) of any two of the sequences which areincluded in the predetermined sequence table may be different, wheres1∈{17, 23, 24, 45} and s2 ∈{17, 23, 24, 45}.

FIG. 5 illustrates a flowchart of an example method 500 for DMRStransmission according to some embodiments of the present disclosure.The method 500 can be implemented at the terminal device 120 as shown inFIG. 1. It is to be understood that the method 500 may includeadditional blocks not shown and/or may omit some blocks as shown, andthe scope of the present disclosure is not limited in this regard.

At block 510, the terminal device 120 selects, from a plurality of CGsequences, a CG sequence for an uplink channel modulated with apredetermined modulation technique.

At block 520, the terminal device 120 generates, based on the selectedCG sequence, a DMRS sequence for the uplink channel.

At block 530, the terminal device 120 transmits, over the uplinkchannel, the DMRS sequence to a network device.

In some embodiments, the uplink channel may be one of PUSCH and PUCCH.The predetermined modulation technique is π/2-BPSK.

In some embodiments, the terminal device 120 may determine the pluralityof CG sequences based on at least one of the following: a predeterminedlength of a CG sequence, a PAPR of a CG sequence, autocorrelation of aCG sequence, and cross-correlation of two CG sequences.

In some embodiments, the terminal device 120 may determine the pluralityof CG sequences by: determining, based on the predetermined length, afirst set of CG sequences; selecting a second set of CG sequences fromthe first set of CG sequences, such that the PAPR of each of the secondset of CG sequences is below a first threshold and the autocorrelationof each of the second set of CG sequences is below a second threshold;and selecting the plurality of CG sequences from the second set of CGsequences.

In some embodiments, the terminal device 120 may select the plurality ofCG sequences from the second set of CG sequences by: dividing the secondset of CG sequences into a first subset and a second subset; iterativelyperforming at least once the following: determining, from the firstsubset, a first pair of CG sequences associated with the highestcross-correlation among the first subset, determining whether a secondpair of CG sequences associated with lower cross-correlation than thehighest cross-correlation are present in the second subset, and inresponse to determining that the second pair of CG sequences are presentin the second subset, replacing the first pair of CG sequences in thefirst subset with the second pair of CG sequences; and determining theplurality of CG sequences based on the first subset.

In some embodiments, the predetermined length is 6, and the plurality ofCG sequences may include one or more of the CG sequences as shown inTable 1-1, Table 1-2 and/or Table 1-3.

In some embodiments, the predetermined length is 12, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 2.

In some embodiments, the predetermined length is 12, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 3-1 and/or Table 3-2.

In some embodiments, the predetermined length is 18, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 4.

In some embodiments, the predetermined length is 18, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 5-1 and/or Table 5-2.

In some embodiments, the predetermined length is 24, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 6.

In some embodiments, the predetermined length is 24, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 7-1 and/or Table 7-2.

FIG. 6 illustrates a flowchart of an example method 600 for DMRStransmission according to some embodiments of the present disclosure.The method 600 can be implemented at the network device 110 as shown inFIG. 1. It is to be understood that the method 600 may includeadditional blocks not shown and/or may omit some blocks as shown, andthe scope of the present disclosure is not limited in this regard.

At block 610, the network device 110 selects, from a plurality of CGsequences, a CG sequence for an uplink channel modulated with apredetermined modulation technique.

At block 620, the network device 110 determines, based on the selectedCG sequence, a DMRS sequence for the uplink channel.

At block 630, the network device 110 receives, over the uplink channel,the DMRS sequence from a terminal device.

In some embodiments, the uplink channel may be one of PUSCH and PUCCH.The predetermined modulation technique is π/2-BPSK.

In some embodiments, the network device 110 may determine the pluralityof CG sequences based on at least one of the following: a predeterminedlength of a CG sequence, a PAPR of a CG sequence, autocorrelation of aCG sequence, and cross-correlation of two CG sequences.

In some embodiments, the network device 110 may determine the pluralityof CG sequences by: determining, based on the predetermined length, afirst set of CG sequences; selecting a second set of CG sequences fromthe first set of CG sequences, such that the PAPR of each of the secondset of CG sequences is below a first threshold and the autocorrelationof each of the second set of CG sequences is below a second threshold;and selecting the plurality of CG sequences from the second set of CGsequences.

In some embodiments, the network device 110 may select the plurality ofCG sequences from the second set of CG sequences by: dividing the secondset of CG sequences into a first subset and a second subset; iterativelyperforming at least once the following: determining, from the firstsubset, a first pair of CG sequences associated with the highestcross-correlation among the first subset, determining whether a secondpair of CG sequences associated with lower cross-correlation than thehighest cross-correlation are present in the second subset, and inresponse to determining that the second pair of CG sequences are presentin the second subset, replacing the first pair of CG sequences in thefirst subset with the second pair of CG sequences; and determining theplurality of CG sequences based on the first subset.

In some embodiments, the predetermined length is 6, and the plurality ofCG sequences may include one or more of the CG sequences as shown inTable 1-1, Table 1-2 and/or Table 1-3.

In some embodiments, the predetermined length is 12, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 2.

In some embodiments, the predetermined length is 12, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 3-1 and/or Table 3-2.

In some embodiments, the predetermined length is 18, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 4.

In some embodiments, the predetermined length is 18, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 5-1 and/or Table 5-2.

In some embodiments, the predetermined length is 24, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 6.

In some embodiments, the predetermined length is 24, and the pluralityof CG sequences may include one or more of the CG sequences as shown inTable 7-1 and/or Table 7-2.

FIG. 7 is a simplified block diagram of a device 700 that is suitablefor implementing embodiments of the present disclosure. The device 700can be considered as a further example implementation of the networkdevice 110 or the terminal device 120 as shown in FIG. 1. Accordingly,the device 700 can be implemented at or as at least a part of thenetwork device 110 or the terminal device 120.

As shown, the device 700 includes a processor 710, a memory 720 coupledto the processor 710, a suitable transmitter (TX) and receiver (RX) 740coupled to the processor 710, and a communication interface coupled tothe TX/RX 740. The memory 710 stores at least a part of a program 730.The TX/RX 740 is for bidirectional communications. The TX/RX 740 has atleast one antenna to facilitate communication, though in practice anAccess Node mentioned in this application may have several ones. Thecommunication interface may represent any interface that is necessaryfor communication with other network elements, such as X2 interface forbidirectional communications between eNBs, S1 interface forcommunication between a Mobility Management Entity (MME)/Serving Gateway(S-GW) and the eNB, Un interface for communication between the eNB and arelay node (RN), or Uu interface for communication between the eNB and aterminal device.

The program 730 is assumed to include program instructions that, whenexecuted by the associated processor 710, enable the device 700 tooperate in accordance with the embodiments of the present disclosure, asdiscussed herein with reference to FIGS. 1 to 6. The embodiments hereinmay be implemented by computer software executable by the processor 710of the device 700, or by hardware, or by a combination of software andhardware. The processor 710 may be configured to implement variousembodiments of the present disclosure. Furthermore, a combination of theprocessor 710 and memory 720 may form processing means 750 adapted toimplement various embodiments of the present disclosure.

The memory 720 may be of any type suitable to the local technicalnetwork and may be implemented using any suitable data storagetechnology, such as a non-transitory computer readable storage medium,semiconductor based memory devices, magnetic memory devices and systems,optical memory devices and systems, fixed memory and removable memory,as non-limiting examples. While only one memory 720 is shown in thedevice 700, there may be several physically distinct memory modules inthe device 700. The processor 710 may be of any type suitable to thelocal technical network, and may include one or more of general purposecomputers, special purpose computers, microprocessors, digital signalprocessors (DSPs) and processors based on multicore processorarchitecture, as non-limiting examples. The device 700 may have multipleprocessors, such as an application specific integrated circuit chip thatis slaved in time to a clock which synchronizes the main processor.

Generally, various embodiments of the present disclosure may beimplemented in hardware or special purpose circuits, software, logic orany combination thereof. Some aspects may be implemented in hardware,while other aspects may be implemented in firmware or software which maybe executed by a controller, microprocessor or other computing device.While various aspects of embodiments of the present disclosure areillustrated and described as block diagrams, flowcharts, or using someother pictorial representation, it will be appreciated that the blocks,apparatus, systems, techniques or methods described herein may beimplemented in, as non-limiting examples, hardware, software, firmware,special purpose circuits or logic, general purpose hardware orcontroller or other computing devices, or some combination thereof.

The present disclosure also provides at least one computer programproduct tangibly stored on a non-transitory computer readable storagemedium. The computer program product includes computer-executableinstructions, such as those included in program modules, being executedin a device on a target real or virtual processor, to carry out theprocess or method as described above with reference to FIGS. 5-6.Generally, program modules include routines, programs, libraries,objects, classes, components, data structures, or the like that performparticular tasks or implement particular abstract data types. Thefunctionality of the program modules may be combined or split betweenprogram modules as desired in various embodiments. Machine-executableinstructions for program modules may be executed within a local ordistributed device. In a distributed device, program modules may belocated in both local and remote storage media.

Program code for carrying out methods of the present disclosure may bewritten in any combination of one or more programming languages. Theseprogram codes may be provided to a processor or controller of a generalpurpose computer, special purpose computer, or other programmable dataprocessing apparatus, such that the program codes, when executed by theprocessor or controller, cause the functions/operations specified in theflowcharts and/or block diagrams to be implemented. The program code mayexecute entirely on a machine, partly on the machine, as a stand-alonesoftware package, partly on the machine and partly on a remote machineor entirely on the remote machine or server.

The above program code may be embodied on a machine readable medium,which may be any tangible medium that may contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device. The machine readable medium may be a machinereadable signal medium or a machine readable storage medium. A machinereadable medium may include but not limited to an electronic, magnetic,optical, electromagnetic, infrared, or semiconductor system, apparatus,or device, or any suitable combination of the foregoing. More specificexamples of the machine readable storage medium would include anelectrical connection having one or more wires, a portable computerdiskette, a hard disk, a random access memory (RAM), a read-only memory(ROM), an erasable programmable read-only memory (EPROM or Flashmemory), an optical fiber, a portable compact disc read-only memory(CD-ROM), an optical storage device, a magnetic storage device, or anysuitable combination of the foregoing.

Further, while operations are depicted in a particular order, thisshould not be understood as requiring that such operations be performedin the particular order shown or in sequential order, or that allillustrated operations be performed, to achieve desirable results. Incertain circumstances, multitasking and parallel processing may beadvantageous. Likewise, while several specific implementation detailsare contained in the above discussions, these should not be construed aslimitations on the scope of the present disclosure, but rather asdescriptions of features that may be specific to particular embodiments.Certain features that are described in the context of separateembodiments may also be implemented in combination in a singleembodiment. Conversely, various features that are described in thecontext of a single embodiment may also be implemented in multipleembodiments separately or in any suitable sub-combination.

Although the present disclosure has been described in language specificto structural features and/or methodological acts, it is to beunderstood that the present disclosure defined in the appended claims isnot necessarily limited to the specific features or acts describedabove. Rather, the specific features and acts described above aredisclosed as example forms of implementing the claims.

1-28. (canceled)
 29. A method implemented at a terminal device,comprising: generating, based on a first sequence, a DemodulationReference Signal (DMRS) sequence for an uplink channel, wherein thefirst sequence is obtained as complex-valued modulation symbolsresulting from a π/2-BPSK modulation applied to a binary sequence givenby a table comprising a plurality of sequences; and transmitting, overthe uplink channel, the DMRS sequence to a base station, wherein, in acase where a length of the first sequence is 12, the plurality ofsequences include the following: {0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0}and {0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0}, in a case where a length ofthe first sequence is 18, the plurality of first sequences include thefollowing: {1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0} and{1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0}, and in a casewhere a length of the first sequence is 24, the plurality of firstsequences include the following: {1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1,0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0}, {1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0,0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0}, and {0, 1, 0, 0, 1, 0, 1, 0, 1, 1,0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0}.
 30. The method of claim 29,wherein, in the case where the length of the first sequence is 12, theplurality of first sequences further include at least one of thefollowing: {0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0}, and {0, 1, 1, 1, 1, 1,0, 0, 1, 0, 0, 0}.
 31. The method of claim 29, wherein, in the casewhere the length of the first sequence is 18, the plurality of firstsequences further include {0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0,1, 0, 0}.
 32. The method of claim 29, wherein each binary number of thebinary sequence is expressed as b(i), and each of the complex-valuedmodulation symbols is defined as:${d(i)} = {{\frac{e^{j\frac{\pi}{2}{({{imod}2})}}}{\sqrt{2}}\lbrack {( {i - {2{b(i)}}} ) + {j( {1 - {2{b(i)}}} )}} \rbrack}.}$33. A method implemented at a base station, comprising: generating,based on a first sequence, a Demodulation Reference Signal (DMRS)sequence for an uplink channel, wherein the first sequence is obtainedas complex-valued modulation symbols resulting from a π/2-BPSKmodulation applied to a binary sequence given by a table comprising aplurality of sequences; and receiving, over the uplink channel, the DMRSsequence from a terminal device, wherein, in a case where a length ofthe first sequence is 12, the plurality of sequences include thefollowing: {0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0} and {0, 0, 1, 1, 1, 1,1, 1, 1, 1, 0, 0}, in a case where a length of the first sequence is 18,the plurality of sequences include the following: {1, 1, 0, 1, 1, 0, 0,0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0} and {1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0,0, 0, 1, 0, 0, 1, 0}, and in a case where a length of the first sequenceis 24, the plurality of first sequences include the following: {1, 0, 0,0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0}, {1, 0,1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0}, and{0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0,0}.
 34. The method of claim 33, wherein, in the case where the length ofthe first sequence is 12, the plurality of first sequences furtherinclude at least one of the following: {0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0,0}, and {0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0}.
 35. The method of claim33, wherein, in the case where the length of the first sequence is 18,the plurality of first sequences further include {0, 1, 1, 1, 1, 1, 1,1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0}.
 36. The method of claim 33, whereineach binary number of the binary sequence is expressed as b(i), and eachof the complex-valued modulation symbols is defined as:${d(i)} = {{\frac{e^{j\frac{\pi}{2}{({{imod}2})}}}{\sqrt{2}}\lbrack {( {i - {2{b(i)}}} ) + {j( {1 - {2{b(i)}}} )}} \rbrack}.}$37. A terminal device comprising: a controller configured to generate,based on a first sequence, a Demodulation Reference Signal (DMRS)sequence for an uplink channel, wherein the first sequence is obtainedas complex-valued modulation symbols resulting from a π/2-BPSKmodulation applied to a binary sequence given by a table comprising aplurality of sequences; and a transmitter configured to transmit, overthe uplink channel, the DMRS sequence to a base station, wherein, in acase where a length of the first sequence is 12, the plurality of firstsequences include the following: {0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0}and {0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0}, in a case where a length ofthe first sequence is 18, the plurality of first sequences include thefollowing: {1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0} and{1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0}, and in a casewhere a length of the first sequence is 24, the plurality of firstsequences include the following: {1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1,0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0}, {1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0,0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0}, and {0, 1, 0, 0, 1, 0, 1, 0, 1, 1,0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0}.
 38. The method of claim 37,wherein, in the case where the length of the first sequence is 12, theplurality of first sequences further include at least one of thefollowing: {0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0}, and {0, 1, 1, 1, 1, 1,0, 0, 1, 0, 0, 0}.
 39. The method of claim 37, wherein, in the casewhere the length of the first sequence is 18, the plurality of firstsequences further include {0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0,1, 0, 0}.
 40. The method of claim 37, wherein each binary number of thebinary sequence is expressed as b(i), and each of the complex-valuedmodulation symbols is defined as:${d(i)} = {{\frac{e^{j\frac{\pi}{2}{({{imod}2})}}}{\sqrt{2}}\lbrack {( {i - {2{b(i)}}} ) + {j( {1 - {2{b(i)}}} )}} \rbrack}.}$